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_sentinel_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:06:09,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:06:09,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:06:09,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:06:09,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:06:09,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:06:09,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:06:09,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:06:09,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:06:09,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:06:09,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:06:09,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:06:09,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:06:09,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:06:09,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:06:09,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:06:09,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:06:09,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:06:09,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:06:09,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:06:09,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:06:09,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:06:09,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:06:09,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:06:09,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:06:09,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:06:09,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:06:09,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:06:09,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:06:09,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:06:09,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:06:09,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:06:09,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:06:09,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:06:09,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:06:09,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:06:09,331 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:09,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:06:09,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:06:09,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:06:09,356 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:06:09,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:06:09,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:06:09,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:06:09,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:06:09,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:06:09,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:06:09,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:06:09,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:06:09,359 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:06:09,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:06:09,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:06:09,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:06:09,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:06:09,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:06:09,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:06:09,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:06:09,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:06:09,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:06:09,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:06:09,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:06:09,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:06:09,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:06:09,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:06:09,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:06:09,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:06:09,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:06:09,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:06:09,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2018-11-23 12:06:09,486 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d83ccc65/eae97a05455347948f659a0a7f59011e/FLAG84e169a27 [2018-11-23 12:06:09,906 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:06:09,907 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2018-11-23 12:06:09,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d83ccc65/eae97a05455347948f659a0a7f59011e/FLAG84e169a27 [2018-11-23 12:06:10,285 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d83ccc65/eae97a05455347948f659a0a7f59011e [2018-11-23 12:06:10,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:06:10,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:06:10,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:10,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:06:10,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:06:10,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:10" (1/1) ... [2018-11-23 12:06:10,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:10, skipping insertion in model container [2018-11-23 12:06:10,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:06:10" (1/1) ... [2018-11-23 12:06:10,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:06:10,348 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:06:10,604 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:10,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:06:10,636 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:06:10,660 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:06:10,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:10 WrapperNode [2018-11-23 12:06:10,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:06:10,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:10,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:06:10,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:06:10,668 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:10" (1/1) ... [2018-11-23 12:06:10,675 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:10" (1/1) ... [2018-11-23 12:06:10,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:06:10,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:06:10,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:06:10,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:06:10,690 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:10" (1/1) ... [2018-11-23 12:06:10,690 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:10" (1/1) ... [2018-11-23 12:06:10,692 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:10" (1/1) ... [2018-11-23 12:06:10,692 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:10" (1/1) ... [2018-11-23 12:06:10,700 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:10" (1/1) ... [2018-11-23 12:06:10,706 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:10" (1/1) ... [2018-11-23 12:06:10,707 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:10" (1/1) ... [2018-11-23 12:06:10,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:06:10,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:06:10,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:06:10,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:06:10,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:10" (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:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:06:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:06:10,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:06:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:06:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:06:10,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:06:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:06:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:06:10,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:06:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:06:10,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:06:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:06:11,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:06:11,282 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:06:11,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:11 BoogieIcfgContainer [2018-11-23 12:06:11,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:06:11,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:06:11,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:06:11,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:06:11,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:06:10" (1/3) ... [2018-11-23 12:06:11,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b19010c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:11, skipping insertion in model container [2018-11-23 12:06:11,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:06:10" (2/3) ... [2018-11-23 12:06:11,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b19010c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:06:11, skipping insertion in model container [2018-11-23 12:06:11,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:11" (3/3) ... [2018-11-23 12:06:11,290 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call_true-termination.i [2018-11-23 12:06:11,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:06:11,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:06:11,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:06:11,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:06:11,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:06:11,358 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:06:11,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:06:11,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:06:11,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:06:11,359 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:06:11,359 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:06:11,359 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:06:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 12:06:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 12:06:11,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:11,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:11,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:11,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -202248900, now seen corresponding path program 1 times [2018-11-23 12:06:11,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 12:06:11,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 12:06:11,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 12:06:11,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-23 12:06:11,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-23 12:06:11,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 12:06:11,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {24#true} is VALID [2018-11-23 12:06:11,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 12:06:11,587 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {25#false} is VALID [2018-11-23 12:06:11,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 12:06:11,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 12:06:11,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 12:06:11,592 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:11,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:11,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:06:11,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 12:06:11,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:11,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:06:11,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:11,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:06:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:06:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:06:11,686 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 12:06:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:11,801 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 12:06:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:06:11,801 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 12:06:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 12:06:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:06:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 12:06:11,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 12:06:12,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:12,242 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:06:12,242 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 12:06:12,245 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:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 12:06:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:06:12,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:12,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 12:06:12,281 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:06:12,282 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:06:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,285 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 12:06:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:06:12,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:12,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:12,286 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:06:12,286 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:06:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,289 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 12:06:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:06:12,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:12,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:12,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:12,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:06:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 12:06:12,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 12:06:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:12,294 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 12:06:12,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:06:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:06:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:06:12,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:12,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:12,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:12,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2095323521, now seen corresponding path program 1 times [2018-11-23 12:06:12,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:12,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:12,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {119#true} is VALID [2018-11-23 12:06:12,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {119#true} is VALID [2018-11-23 12:06:12,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {119#true} assume true; {119#true} is VALID [2018-11-23 12:06:12,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} #40#return; {119#true} is VALID [2018-11-23 12:06:12,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {119#true} call #t~ret3 := main(); {119#true} is VALID [2018-11-23 12:06:12,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {119#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {119#true} is VALID [2018-11-23 12:06:12,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {119#true} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} is VALID [2018-11-23 12:06:12,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} is VALID [2018-11-23 12:06:12,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} is VALID [2018-11-23 12:06:12,535 INFO L256 TraceCheckUtils]: 9: Hoare triple {121#(and (<= 0 main_~pos~0) (= main_~i~0 0))} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {122#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:12,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {123#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:12,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {120#false} is VALID [2018-11-23 12:06:12,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {120#false} assume !false; {120#false} is VALID [2018-11-23 12:06:12,540 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:12,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:06:12,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:06:12,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:06:12,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:12,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:06:12,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:12,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:06:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:06:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:06:12,632 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-23 12:06:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:12,921 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:06:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:06:12,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:06:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-23 12:06:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:06:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-23 12:06:12,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2018-11-23 12:06:12,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:13,000 INFO L225 Difference]: With dead ends: 21 [2018-11-23 12:06:13,001 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 12:06:13,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:06:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 12:06:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 12:06:13,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:13,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 12:06:13,120 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 12:06:13,121 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 12:06:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,123 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 12:06:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 12:06:13,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:13,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:13,124 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 12:06:13,124 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 12:06:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:13,126 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 12:06:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 12:06:13,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:13,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:13,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:13,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:06:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 12:06:13,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 12:06:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:13,130 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 12:06:13,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:06:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 12:06:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:06:13,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:13,131 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:13,131 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:13,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:13,132 INFO L82 PathProgramCache]: Analyzing trace with hash 171646118, now seen corresponding path program 1 times [2018-11-23 12:06:13,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:13,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:13,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:13,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:13,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:13,750 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-11-23 12:06:14,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-23 12:06:14,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-23 12:06:14,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-23 12:06:14,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #40#return; {215#true} is VALID [2018-11-23 12:06:14,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret3 := main(); {215#true} is VALID [2018-11-23 12:06:14,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {217#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:06:14,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= |main_~#a~0.offset| 0)} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {218#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:14,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {219#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:14,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {219#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {220#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:14,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {220#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {221#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:14,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#(<= main_~i~0 main_~pos~0)} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {221#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:14,192 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#(<= main_~i~0 main_~pos~0)} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {222#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:14,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {223#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:14,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {216#false} is VALID [2018-11-23 12:06:14,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-23 12:06:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:14,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:14,197 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:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:14,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:14,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:06:14,362 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:14,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:14,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:14,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:14,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 12:06:14,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 12:06:14,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:06:14,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:06:14,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:14,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 12:06:14,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2018-11-23 12:06:14,676 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:14,676 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= |main_#t~mem2| (select .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 0 main_~pos~0) (= (select .cse0 (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0) (<= main_~i~0 0))) [2018-11-23 12:06:14,676 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#a~0.offset|]. (let ((.cse0 (<= 0 main_~pos~0)) (.cse1 (<= main_~i~0 0))) (or (and .cse0 (not (= (+ (* 4 main_~i~0) |main_~#a~0.offset|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|))) .cse1) (and .cse0 (= |main_#t~mem2| main_~marker~0) .cse1))) [2018-11-23 12:06:14,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-23 12:06:14,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-23 12:06:14,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-23 12:06:14,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #40#return; {215#true} is VALID [2018-11-23 12:06:14,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret3 := main(); {215#true} is VALID [2018-11-23 12:06:14,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {215#true} is VALID [2018-11-23 12:06:14,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#true} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {245#(and (<= 0 main_~pos~0) (<= main_~i~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0))} is VALID [2018-11-23 12:06:14,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {245#(and (<= 0 main_~pos~0) (<= main_~i~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~pos~0) |main_~#a~0.offset|)) main_~marker~0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {249#(or (and (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (<= main_~i~0 0)) (and (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (<= 0 main_~pos~0) (<= main_~i~0 0)))} is VALID [2018-11-23 12:06:14,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(or (and (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (<= main_~i~0 0)) (and (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (<= 0 main_~pos~0) (<= main_~i~0 0)))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:06:14,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:06:14,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:06:14,908 INFO L256 TraceCheckUtils]: 11: Hoare triple {253#(and (<= main_~i~0 main_~pos~0) (<= 0 main_~pos~0) (<= main_~i~0 1))} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {222#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:14,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {223#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:14,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {216#false} is VALID [2018-11-23 12:06:14,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-23 12:06:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:14,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:14,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-23 12:06:14,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-23 12:06:14,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:14,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:06:14,964 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:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:06:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:06:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:06:14,966 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2018-11-23 12:06:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:15,322 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 12:06:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:06:15,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-23 12:06:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 12:06:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:06:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 12:06:15,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 12:06:15,368 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:15,369 INFO L225 Difference]: With dead ends: 23 [2018-11-23 12:06:15,370 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:06:15,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:06:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:06:15,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:15,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:15,401 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:15,401 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:15,404 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 12:06:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 12:06:15,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:15,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:15,405 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:15,405 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:06:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:15,406 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 12:06:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 12:06:15,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:15,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:15,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:15,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:06:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 12:06:15,409 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 12:06:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:15,409 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 12:06:15,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:06:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 12:06:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:06:15,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:15,411 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:15,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:15,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1646400885, now seen corresponding path program 2 times [2018-11-23 12:06:15,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:15,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,889 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2018-11-23 12:06:16,125 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2018-11-23 12:06:16,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-23 12:06:16,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {374#true} is VALID [2018-11-23 12:06:16,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-23 12:06:16,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #40#return; {374#true} is VALID [2018-11-23 12:06:16,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret3 := main(); {374#true} is VALID [2018-11-23 12:06:16,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {376#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:06:16,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= |main_~#a~0.offset| 0)} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {377#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:16,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {377#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {378#(and (or (and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0))))) (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:16,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {378#(and (or (and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0))))) (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {379#(and (or (not (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:16,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {379#(and (or (not (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {380#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:16,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {380#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {381#(and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:16,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {381#(and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {382#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:16,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#(<= main_~i~0 main_~pos~0)} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {382#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:16,563 INFO L256 TraceCheckUtils]: 13: Hoare triple {382#(<= main_~i~0 main_~pos~0)} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {383#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:16,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {383#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {384#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:16,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {384#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {375#false} is VALID [2018-11-23 12:06:16,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-23 12:06:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:16,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:16,568 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:16,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:16,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:16,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:16,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:16,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:06:16,676 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:16,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:16,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:16,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:16,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-23 12:06:16,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 12:06:16,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 12:06:16,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 12:06:16,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:16,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:16,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:48 [2018-11-23 12:06:16,917 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:16,918 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= |main_#t~mem2| (select .cse0 (* 4 main_~i~0))) (= (select .cse0 (* 4 main_~pos~0)) main_~marker~0) (<= 0 main_~pos~0) (<= main_~i~0 1) (not (= (select .cse0 0) main_~marker~0)))) [2018-11-23 12:06:16,918 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (* 4 main_~pos~0))) (let ((.cse0 (* 4 main_~i~0)) (.cse1 (= |main_#t~mem2| main_~marker~0)) (.cse2 (<= 0 main_~pos~0)) (.cse3 (<= main_~i~0 1)) (.cse4 (not (= 0 .cse5)))) (or (and (not (= .cse0 0)) .cse1 .cse2 .cse3 .cse4) (and (not (= .cse0 .cse5)) (not .cse1) .cse2 .cse3 .cse4)))) [2018-11-23 12:06:17,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-23 12:06:17,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {374#true} is VALID [2018-11-23 12:06:17,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-23 12:06:17,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #40#return; {374#true} is VALID [2018-11-23 12:06:17,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret3 := main(); {374#true} is VALID [2018-11-23 12:06:17,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {376#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:06:17,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= |main_~#a~0.offset| 0)} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {377#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:17,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {377#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {409#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:17,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {409#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {413#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:17,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {417#(or (and (not (= (* 4 main_~i~0) 0)) (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (<= main_~i~0 1) (not (= 0 (* 4 main_~pos~0)))) (and (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (not (= |main_#t~mem2| main_~marker~0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (not (= 0 (* 4 main_~pos~0)))))} is VALID [2018-11-23 12:06:17,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {417#(or (and (not (= (* 4 main_~i~0) 0)) (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (<= main_~i~0 1) (not (= 0 (* 4 main_~pos~0)))) (and (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (not (= |main_#t~mem2| main_~marker~0)) (<= 0 main_~pos~0) (<= main_~i~0 1) (not (= 0 (* 4 main_~pos~0)))))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} is VALID [2018-11-23 12:06:17,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} is VALID [2018-11-23 12:06:17,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} is VALID [2018-11-23 12:06:17,322 INFO L256 TraceCheckUtils]: 13: Hoare triple {421#(and (<= main_~i~0 main_~pos~0) (<= main_~i~0 2) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0))))} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {383#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:17,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {383#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {384#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:17,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {384#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {375#false} is VALID [2018-11-23 12:06:17,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-23 12:06:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:17,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:17,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2018-11-23 12:06:17,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-23 12:06:17,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:17,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:06:17,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:06:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:06:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:06:17,381 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-11-23 12:06:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,258 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:06:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:06:18,258 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-23 12:06:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-11-23 12:06:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:06:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-11-23 12:06:18,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2018-11-23 12:06:18,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:18,311 INFO L225 Difference]: With dead ends: 28 [2018-11-23 12:06:18,311 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:06:18,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:06:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:06:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:06:18,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:18,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,364 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,364 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,366 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 12:06:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 12:06:18,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,367 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,367 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:06:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:18,369 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 12:06:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 12:06:18,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:18,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:18,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:18,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:06:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 12:06:18,371 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2018-11-23 12:06:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:18,372 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 12:06:18,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:06:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 12:06:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:06:18,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:18,373 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:18,373 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:18,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 471082645, now seen corresponding path program 3 times [2018-11-23 12:06:18,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:19,453 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2018-11-23 12:06:19,773 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2018-11-23 12:06:20,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-23 12:06:20,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {566#true} is VALID [2018-11-23 12:06:20,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 12:06:20,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #40#return; {566#true} is VALID [2018-11-23 12:06:20,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret3 := main(); {566#true} is VALID [2018-11-23 12:06:20,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {568#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:06:20,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#(= |main_~#a~0.offset| 0)} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {569#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {570#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {570#(and (<= 0 main_~pos~0) (or (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (= |main_#t~mem2| main_~marker~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {571#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {572#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {572#(and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (and (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1))) (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {573#(and (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {573#(and (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {574#(and (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {574#(and (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {575#(and (or (not (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {575#(and (or (not (= main_~pos~0 main_~i~0)) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {576#(and (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {576#(and (or (= |main_#t~mem2| main_~marker~0) (not (= main_~pos~0 main_~i~0))) (or (= main_~pos~0 main_~i~0) (and (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (< main_~i~0 (+ main_~pos~0 1)))) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {577#(and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:20,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {577#(and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) (<= 0 main_~pos~0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {578#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:20,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {578#(<= main_~i~0 main_~pos~0)} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {578#(<= main_~i~0 main_~pos~0)} is VALID [2018-11-23 12:06:20,176 INFO L256 TraceCheckUtils]: 17: Hoare triple {578#(<= main_~i~0 main_~pos~0)} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {579#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:20,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {580#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:20,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {580#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {567#false} is VALID [2018-11-23 12:06:20,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-23 12:06:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:20,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:20,180 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,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:20,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:06:20,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:20,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:20,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:06:20,357 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:20,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:06:20,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:20,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:06:20,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-23 12:06:20,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-11-23 12:06:20,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 97 [2018-11-23 12:06:20,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 12:06:20,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 36 xjuncts. [2018-11-23 12:06:21,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:21,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:06:21,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:120 [2018-11-23 12:06:21,167 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:06:21,167 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_main_~i~0_12]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (not (= (select .cse0 (* 4 v_main_~i~0_12)) main_~marker~0)) (not (= (select .cse0 4) main_~marker~0)) (= |main_#t~mem2| (select .cse0 (* 4 main_~i~0))) (<= main_~i~0 (+ v_main_~i~0_12 1)) (= (select .cse0 (* 4 main_~pos~0)) main_~marker~0) (<= 0 main_~pos~0) (<= v_main_~i~0_12 2) (not (= (select .cse0 0) main_~marker~0)))) [2018-11-23 12:06:21,168 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (<= main_~i~0 3)) (.cse7 (<= main_~i~0 main_~pos~0)) (.cse10 (* 4 main_~pos~0))) (let ((.cse0 (not (= 4 .cse10))) (.cse4 (and .cse5 .cse7)) (.cse6 (<= main_~pos~0 1)) (.cse1 (* 4 main_~i~0)) (.cse2 (= |main_#t~mem2| main_~marker~0)) (.cse3 (<= 0 main_~pos~0)) (.cse9 (not (= 0 .cse10)))) (or (and .cse0 (not (= .cse1 0)) (not (= .cse1 4)) .cse2 .cse3 (let ((.cse8 (<= main_~i~0 1))) (or .cse4 (and .cse5 (<= (+ main_~pos~0 2) main_~i~0) .cse6) (and .cse7 .cse5 .cse8 (<= (+ main_~i~0 2) main_~pos~0)) (and .cse5 .cse6 .cse8))) .cse9) (and .cse0 (or .cse4 (and .cse5 .cse6)) (not (= .cse1 .cse10)) (not .cse2) .cse3 .cse9)))) [2018-11-23 12:06:21,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-23 12:06:21,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {566#true} is VALID [2018-11-23 12:06:21,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-23 12:06:21,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #40#return; {566#true} is VALID [2018-11-23 12:06:21,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret3 := main(); {566#true} is VALID [2018-11-23 12:06:21,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~marker~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pos~0 := #t~nondet1;havoc #t~nondet1; {568#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:06:21,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#(= |main_~#a~0.offset| 0)} assume ~pos~0 >= 0 && ~pos~0 < 100000;call write~int(~marker~0, ~#a~0.base, ~#a~0.offset + 4 * ~pos~0, 4);~i~0 := 0; {569#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(and (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {605#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {605#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {609#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {609#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {613#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~i~0 1) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {617#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= main_~i~0 2) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {617#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= main_~i~0 2) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {621#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= main_~i~0 2) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {621#(and (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= main_~i~0 2) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (= |main_~#a~0.offset| 0))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {625#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (exists ((v_main_~i~0_12 Int)) (and (not (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|)))) (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 2))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:06:21,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#(and (not (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) main_~marker~0)) (not (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) main_~marker~0)) (<= 0 main_~pos~0) (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~pos~0)))) (exists ((v_main_~i~0_12 Int)) (and (not (= main_~marker~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_main_~i~0_12) |main_~#a~0.offset|)))) (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 2))) (= |main_~#a~0.offset| 0))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {629#(or (and (not (= 4 (* 4 main_~pos~0))) (<= main_~i~0 3) (<= main_~i~0 main_~pos~0) (not (= (* 4 main_~i~0) 0)) (not (= (* 4 main_~i~0) 4)) (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (not (= 0 (* 4 main_~pos~0)))) (and (not (= 4 (* 4 main_~pos~0))) (<= main_~i~0 3) (<= main_~i~0 main_~pos~0) (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (not (= |main_#t~mem2| main_~marker~0)) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0)))))} is VALID [2018-11-23 12:06:21,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {629#(or (and (not (= 4 (* 4 main_~pos~0))) (<= main_~i~0 3) (<= main_~i~0 main_~pos~0) (not (= (* 4 main_~i~0) 0)) (not (= (* 4 main_~i~0) 4)) (<= 0 main_~pos~0) (= |main_#t~mem2| main_~marker~0) (not (= 0 (* 4 main_~pos~0)))) (and (not (= 4 (* 4 main_~pos~0))) (<= main_~i~0 3) (<= main_~i~0 main_~pos~0) (not (= (* 4 main_~i~0) (* 4 main_~pos~0))) (not (= |main_#t~mem2| main_~marker~0)) (<= 0 main_~pos~0) (not (= 0 (* 4 main_~pos~0)))))} assume !!(#t~mem2 != ~marker~0);havoc #t~mem2;~i~0 := 1 + ~i~0; {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} is VALID [2018-11-23 12:06:21,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} is VALID [2018-11-23 12:06:21,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} assume !(#t~mem2 != ~marker~0);havoc #t~mem2; {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} is VALID [2018-11-23 12:06:21,493 INFO L256 TraceCheckUtils]: 17: Hoare triple {633#(and (not (= 4 (* 4 main_~pos~0))) (not (= (+ (* 4 main_~pos~0) 4) (* 4 main_~i~0))) (<= 0 main_~pos~0) (<= main_~i~0 4) (not (= 0 (* 4 main_~pos~0))) (<= main_~i~0 (+ main_~pos~0 1)))} call __VERIFIER_assert((if ~i~0 <= ~pos~0 then 1 else 0)); {579#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:06:21,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {580#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:06:21,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {580#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {567#false} is VALID [2018-11-23 12:06:21,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-23 12:06:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:21,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-11-23 12:06:21,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2018-11-23 12:06:21,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:21,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:06:21,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:21,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:06:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:06:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:06:21,571 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 23 states. [2018-11-23 12:06:22,059 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-11-23 12:06:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,516 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:06:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:06:22,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2018-11-23 12:06:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-11-23 12:06:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:06:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-11-23 12:06:22,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 26 transitions. [2018-11-23 12:06:22,553 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:22,553 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:06:22,553 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:06:22,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:06:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:06:22,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:22,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:06:22,557 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:06:22,557 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:06:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,558 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:06:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:06:22,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,558 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:06:22,558 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:06:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:22,559 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:06:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:06:22,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:22,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:22,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:06:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:06:22,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 12:06:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:22,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:06:22,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:06:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:06:22,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:22,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:06:22,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:06:22,787 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:06:22,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:06:22,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:06:22,787 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:06:22,788 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:06:22,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:06:22,788 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 17) the Hoare annotation is: true [2018-11-23 12:06:22,788 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 17) no Hoare annotation was computed. [2018-11-23 12:06:22,788 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 17) no Hoare annotation was computed. [2018-11-23 12:06:22,788 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-23 12:06:22,788 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 15) no Hoare annotation was computed. [2018-11-23 12:06:22,789 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (let ((.cse4 (* 4 main_~pos~0))) (let ((.cse2 (+ .cse4 |main_~#a~0.offset|)) (.cse0 (<= 0 main_~pos~0)) (.cse1 (select |#memory_int| |main_~#a~0.base|)) (.cse3 (= |main_~#a~0.offset| 0))) (or (and .cse0 (= (select .cse1 .cse2) main_~marker~0) (= main_~i~0 0) .cse3) (and (not (= .cse2 0)) .cse0 (= main_~marker~0 (select .cse1 (+ |main_~#a~0.offset| .cse4))) (< main_~i~0 (+ main_~pos~0 1)) .cse3)))) [2018-11-23 12:06:22,789 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (let ((.cse0 (<= 0 main_~pos~0))) (or (and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) .cse0 (= |main_~#a~0.offset| 0)) (and .cse0 (= main_~i~0 0)))) [2018-11-23 12:06:22,789 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 15) no Hoare annotation was computed. [2018-11-23 12:06:22,789 INFO L448 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2018-11-23 12:06:22,789 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2018-11-23 12:06:22,789 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2018-11-23 12:06:22,790 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2018-11-23 12:06:22,790 INFO L448 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2018-11-23 12:06:22,790 INFO L448 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2018-11-23 12:06:22,791 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:06:22,791 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-23 12:06:22,791 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 12:06:22,791 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:06:22,792 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L3-1 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L3-3 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2018-11-23 12:06:22,813 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 12:06:22,814 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-23 12:06:22,814 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:06:22,814 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 12:06:22,814 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:06:22,814 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:06:22,821 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,822 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,825 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,825 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:06:22 BoogieIcfgContainer [2018-11-23 12:06:22,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:06:22,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:06:22,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:06:22,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:06:22,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:06:11" (3/4) ... [2018-11-23 12:06:22,837 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:06:22,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:06:22,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:06:22,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 12:06:22,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 12:06:22,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 12:06:22,853 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:06:22,907 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 12:06:22,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:06:22,908 INFO L168 Benchmark]: Toolchain (without parser) took 12613.59 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 865.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -465.4 MB). Peak memory consumption was 399.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:06:22,909 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:06:22,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:06:22,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:06:22,910 INFO L168 Benchmark]: Boogie Preprocessor took 26.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:06:22,910 INFO L168 Benchmark]: RCFGBuilder took 573.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:06:22,911 INFO L168 Benchmark]: TraceAbstraction took 11547.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.3 MB). Peak memory consumption was 412.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:06:22,912 INFO L168 Benchmark]: Witness Printer took 76.63 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:06:22,915 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 573.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11547.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 126.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.3 MB). Peak memory consumption was 412.2 MB. Max. memory is 7.1 GB. * Witness Printer took 76.63 ms. Allocated memory is still 2.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2018-11-23 12:06:22,930 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,930 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,932 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:06:22,933 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((0 <= pos && unknown-#memory_int-unknown[a][4 * pos + a] == marker) && i == 0) && a == 0) || ((((!(4 * pos + a == 0) && 0 <= pos) && marker == unknown-#memory_int-unknown[a][a + 4 * pos]) && i < pos + 1) && a == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 11.4s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 46 SDslu, 169 SDs, 0 SdLazy, 211 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 84 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 348 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 123 ConstructedInterpolants, 1 QuantifiedInterpolants, 24625 SizeOfPredicates, 18 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...