java -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:09:19,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:09:19,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:09:19,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:09:19,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:09:19,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:09:19,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:09:19,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:09:19,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:09:19,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:09:19,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:09:19,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:09:19,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:09:19,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:09:19,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:09:19,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:09:19,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:09:19,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:09:19,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:09:19,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:09:19,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:09:19,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:09:19,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:09:19,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:09:19,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:09:19,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:09:19,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:09:19,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:09:19,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:09:19,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:09:19,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:09:19,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:09:19,637 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:09:19,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:09:19,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:09:19,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:09:19,640 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:09:19,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:09:19,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:09:19,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:09:19,656 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:09:19,657 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:09:19,657 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:09:19,657 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:09:19,657 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:09:19,657 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:09:19,658 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:09:19,658 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:09:19,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:09:19,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:09:19,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:09:19,659 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:09:19,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:09:19,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:09:19,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:09:19,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:09:19,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:09:19,660 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:09:19,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:09:19,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:09:19,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:09:19,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:09:19,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:09:19,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:09:19,662 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:09:19,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:09:19,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:09:19,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:09:19,663 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:09:19,663 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:09:19,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:09:19,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:09:19,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:09:19,728 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:09:19,728 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:09:19,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-09-10 10:09:20,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/addd08101/fe31a5a1853e44d392765ee84336a87d/FLAGe33b07149 [2018-09-10 10:09:20,256 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:09:20,256 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-09-10 10:09:20,263 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/addd08101/fe31a5a1853e44d392765ee84336a87d/FLAGe33b07149 [2018-09-10 10:09:20,280 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/addd08101/fe31a5a1853e44d392765ee84336a87d [2018-09-10 10:09:20,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:09:20,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:09:20,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:09:20,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:09:20,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:09:20,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125be92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20, skipping insertion in model container [2018-09-10 10:09:20,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,497 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:09:20,551 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:09:20,571 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:09:20,577 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:09:20,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20 WrapperNode [2018-09-10 10:09:20,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:09:20,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:09:20,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:09:20,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:09:20,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:09:20,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:09:20,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:09:20,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:09:20,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (1/1) ... [2018-09-10 10:09:20,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:09:20,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:09:20,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:09:20,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:09:20,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (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-09-10 10:09:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:09:20,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:09:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert [2018-09-10 10:09:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert [2018-09-10 10:09:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:09:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:09:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:09:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:09:20,989 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:09:20,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:09:20 BoogieIcfgContainer [2018-09-10 10:09:20,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:09:20,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:09:20,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:09:20,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:09:20,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:09:20" (1/3) ... [2018-09-10 10:09:20,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a040500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:09:20, skipping insertion in model container [2018-09-10 10:09:20,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:20" (2/3) ... [2018-09-10 10:09:20,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a040500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:09:20, skipping insertion in model container [2018-09-10 10:09:20,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:09:20" (3/3) ... [2018-09-10 10:09:20,999 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-09-10 10:09:21,017 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:09:21,038 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:09:21,119 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:09:21,120 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:09:21,120 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:09:21,120 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:09:21,121 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:09:21,121 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:09:21,121 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:09:21,121 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:09:21,127 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:09:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-10 10:09:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-10 10:09:21,162 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:21,163 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:21,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash 41502113, now seen corresponding path program 1 times [2018-09-10 10:09:21,173 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,224 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:21,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:09:21,290 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:21,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:09:21,311 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:09:21,312 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:09:21,315 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-09-10 10:09:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:21,343 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-09-10 10:09:21,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:09:21,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-10 10:09:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:21,354 INFO L225 Difference]: With dead ends: 37 [2018-09-10 10:09:21,354 INFO L226 Difference]: Without dead ends: 15 [2018-09-10 10:09:21,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:09:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-10 10:09:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-10 10:09:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-10 10:09:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-10 10:09:21,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-09-10 10:09:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:21,395 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-10 10:09:21,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:09:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-10 10:09:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-10 10:09:21,396 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:21,396 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:21,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash 634139664, now seen corresponding path program 1 times [2018-09-10 10:09:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,399 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:21,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:21,520 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:21,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:21,522 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:21,522 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:21,523 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-09-10 10:09:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:21,575 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-10 10:09:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:21,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-10 10:09:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:21,576 INFO L225 Difference]: With dead ends: 25 [2018-09-10 10:09:21,577 INFO L226 Difference]: Without dead ends: 20 [2018-09-10 10:09:21,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-10 10:09:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-09-10 10:09:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-10 10:09:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-10 10:09:21,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-09-10 10:09:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:21,583 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-10 10:09:21,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-10 10:09:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:09:21,584 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:21,584 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:21,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 325396729, now seen corresponding path program 1 times [2018-09-10 10:09:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,586 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,659 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:21,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:21,660 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:21,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:21,661 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:21,661 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:21,661 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-09-10 10:09:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:21,700 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-09-10 10:09:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:21,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-10 10:09:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:21,701 INFO L225 Difference]: With dead ends: 29 [2018-09-10 10:09:21,701 INFO L226 Difference]: Without dead ends: 19 [2018-09-10 10:09:21,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-10 10:09:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-10 10:09:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-10 10:09:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-10 10:09:21,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-10 10:09:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:21,708 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-10 10:09:21,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-10 10:09:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-10 10:09:21,709 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:21,710 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:21,710 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1217230829, now seen corresponding path program 1 times [2018-09-10 10:09:21,710 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:21,712 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,843 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:21,843 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:09:21,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,859 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:09:22,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:22,190 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:22,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:22,206 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:22,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:09:22,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-10 10:09:22,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:22,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4, 6, 6] total 15 [2018-09-10 10:09:22,715 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:22,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:09:22,716 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:09:22,717 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:09:22,717 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-09-10 10:09:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:22,991 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-09-10 10:09:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 10:09:22,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-09-10 10:09:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:22,998 INFO L225 Difference]: With dead ends: 49 [2018-09-10 10:09:22,998 INFO L226 Difference]: Without dead ends: 37 [2018-09-10 10:09:22,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:09:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-10 10:09:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-09-10 10:09:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-10 10:09:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-09-10 10:09:23,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-09-10 10:09:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:23,007 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-09-10 10:09:23,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:09:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-09-10 10:09:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-10 10:09:23,008 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:23,008 INFO L376 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:23,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1660228784, now seen corresponding path program 2 times [2018-09-10 10:09:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:23,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:23,011 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:09:23,115 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:23,115 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 10:09:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:23,131 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:23,148 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:09:23,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:23,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:09:23,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:09:23,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:23,639 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:09:23,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:23,655 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:23,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:09:23,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:23,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:09:23,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:09:23,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:23,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-09-10 10:09:23,719 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:23,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:09:23,720 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:09:23,720 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:09:23,721 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-09-10 10:09:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:24,075 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-09-10 10:09:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-10 10:09:24,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-09-10 10:09:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:24,079 INFO L225 Difference]: With dead ends: 71 [2018-09-10 10:09:24,079 INFO L226 Difference]: Without dead ends: 54 [2018-09-10 10:09:24,080 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:09:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-10 10:09:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-09-10 10:09:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-10 10:09:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-09-10 10:09:24,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2018-09-10 10:09:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:24,089 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-09-10 10:09:24,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:09:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-09-10 10:09:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-10 10:09:24,091 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:24,091 INFO L376 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:24,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash 788287271, now seen corresponding path program 3 times [2018-09-10 10:09:24,092 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:24,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:24,094 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-10 10:09:24,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:24,229 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:09:24,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:09:24,239 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:09:24,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-10 10:09:24,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:24,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:26,392 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 2))) (let ((.cse1 (mod v_prenex_2 4294967296)) (.cse2 (mod (+ .cse0 4294967294) 4294967296))) (and (not (= 0 .cse0)) (< .cse1 0) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= 268435455 .cse1) (<= .cse2 2147483647) (= |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| .cse2))))) (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 4294967296)) (.cse4 (mod v_prenex_1 2))) (and (<= 268435455 .cse3) (<= 0 .cse3) (< 2147483647 .cse4) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= .cse4 (+ |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| 4294967296))))) (exists ((v_prenex_3 Int)) (let ((.cse5 (mod v_prenex_3 2))) (and (= 0 .cse5) (<= 268435455 (mod v_prenex_3 4294967296)) (= .cse5 (+ |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| 4294967296)) (< 2147483647 .cse5) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_5 Int)) (let ((.cse6 (mod v_prenex_5 4294967296)) (.cse7 (mod v_prenex_5 2))) (and (<= 0 .cse6) (<= .cse7 2147483647) (<= 268435455 .cse6) (= |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| .cse7) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455)))) (exists ((v_main_~x~0_BEFORE_CALL_2 Int)) (let ((.cse8 (mod v_main_~x~0_BEFORE_CALL_2 2))) (let ((.cse10 (mod v_main_~x~0_BEFORE_CALL_2 4294967296)) (.cse9 (mod (+ .cse8 4294967294) 4294967296))) (and (not (= 0 .cse8)) (= (+ |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| 4294967296) .cse9) (< (mod (+ v_main_~x~0_BEFORE_CALL_2 4294967295) 4294967296) 268435455) (< .cse10 0) (<= 268435455 .cse10) (< 2147483647 .cse9))))) (exists ((v_prenex_4 Int)) (let ((.cse11 (mod v_prenex_4 2))) (and (= |c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_#in~cond| .cse11) (= 0 .cse11) (<= 268435455 (mod v_prenex_4 4294967296)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455) (<= .cse11 2147483647))))) is different from true [2018-09-10 10:09:28,457 WARN L1032 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 4294967296)) (.cse1 (mod v_prenex_1 2))) (and (<= 268435455 .cse0) (<= 0 .cse0) (< 2147483647 .cse1) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= .cse1 (+ c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond 4294967296))))) (exists ((v_prenex_5 Int)) (let ((.cse2 (mod v_prenex_5 4294967296)) (.cse3 (mod v_prenex_5 2))) (and (<= 0 .cse2) (<= .cse3 2147483647) (<= 268435455 .cse2) (= .cse3 c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_3 Int)) (let ((.cse4 (mod v_prenex_3 2))) (and (= 0 .cse4) (<= 268435455 (mod v_prenex_3 4294967296)) (= .cse4 (+ c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond 4294967296)) (< 2147483647 .cse4) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 2))) (let ((.cse6 (mod v_prenex_2 4294967296)) (.cse7 (mod (+ .cse5 4294967294) 4294967296))) (and (not (= 0 .cse5)) (< .cse6 0) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (= .cse7 c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond) (<= 268435455 .cse6) (<= .cse7 2147483647))))) (exists ((v_main_~x~0_BEFORE_CALL_2 Int)) (let ((.cse8 (mod v_main_~x~0_BEFORE_CALL_2 2))) (let ((.cse10 (mod v_main_~x~0_BEFORE_CALL_2 4294967296)) (.cse9 (mod (+ .cse8 4294967294) 4294967296))) (and (not (= 0 .cse8)) (= .cse9 (+ c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond 4294967296)) (< (mod (+ v_main_~x~0_BEFORE_CALL_2 4294967295) 4294967296) 268435455) (< .cse10 0) (<= 268435455 .cse10) (< 2147483647 .cse9))))) (exists ((v_prenex_4 Int)) (let ((.cse11 (mod v_prenex_4 2))) (and (= .cse11 c___U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assert_~cond) (= 0 .cse11) (<= 268435455 (mod v_prenex_4 4294967296)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455) (<= .cse11 2147483647))))) is different from true [2018-09-10 10:09:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 10:09:28,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-10 10:09:34,878 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:09:34,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6] total 16 [2018-09-10 10:09:34,879 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:34,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:09:34,879 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:09:34,880 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=5, NotChecked=50, Total=240 [2018-09-10 10:09:34,880 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-09-10 10:09:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:36,945 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-09-10 10:09:36,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:09:36,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-09-10 10:09:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:36,946 INFO L225 Difference]: With dead ends: 45 [2018-09-10 10:09:36,947 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:09:36,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=40, Invalid=172, Unknown=6, NotChecked=54, Total=272 [2018-09-10 10:09:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:09:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:09:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:09:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:09:36,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-09-10 10:09:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:36,948 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:09:36,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:09:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:09:36,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:09:36,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:09:37,093 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-10 10:09:37,093 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:09:37,093 INFO L426 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-09-10 10:09:37,093 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_nested_true_unreach_call__i____VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-10 10:09:37,094 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-09-10 10:09:37,094 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-09-10 10:09:37,095 INFO L426 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-09-10 10:09:37,095 INFO L426 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-09-10 10:09:37,095 INFO L422 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-09-10 10:09:37,095 INFO L426 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-09-10 10:09:37,095 INFO L422 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-09-10 10:09:37,095 INFO L422 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-09-10 10:09:37,095 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-09-10 10:09:37,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:09:37 BoogieIcfgContainer [2018-09-10 10:09:37,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:09:37,107 INFO L168 Benchmark]: Toolchain (without parser) took 16815.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -515.9 MB). Peak memory consumption was 201.4 MB. Max. memory is 7.1 GB. [2018-09-10 10:09:37,109 INFO L168 Benchmark]: CDTParser took 0.20 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-09-10 10:09:37,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.78 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-09-10 10:09:37,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.70 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-09-10 10:09:37,111 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 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-09-10 10:09:37,112 INFO L168 Benchmark]: RCFGBuilder took 348.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:09:37,113 INFO L168 Benchmark]: TraceAbstraction took 16115.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 242.6 MB). Peak memory consumption was 242.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:09:37,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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. * CACSL2BoogieTranslator took 299.78 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 23.70 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 21.99 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 348.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16115.02 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 242.6 MB). Peak memory consumption was 242.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 15.9s OverallTime, 6 OverallIterations, 12 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 28 SDslu, 199 SDs, 0 SdLazy, 156 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 30 NumberOfFragments, 56 HoareAnnotationTreeSize, 13 FomulaSimplifications, 353 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 266 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 388 ConstructedInterpolants, 2 QuantifiedInterpolants, 54416 SizeOfPredicates, 9 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 518/648 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested_true-unreach-call1.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-09-37-134.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested_true-unreach-call1.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-09-37-134.csv Received shutdown request...