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-invgen/nested9_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:51:05,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:51:05,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:51:05,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:51:05,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:51:05,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:51:05,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:51:05,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:51:05,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:51:05,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:51:05,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:51:05,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:51:05,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:51:05,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:51:05,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:51:05,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:51:05,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:51:05,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:51:05,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:51:05,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:51:05,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:51:05,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:51:05,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:51:05,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:51:05,806 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:51:05,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:51:05,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:51:05,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:51:05,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:51:05,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:51:05,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:51:05,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:51:05,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:51:05,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:51:05,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:51:05,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:51:05,814 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-14 15:51:05,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:51:05,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:51:05,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:51:05,835 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:51:05,836 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:51:05,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:51:05,836 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:51:05,836 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:51:05,836 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:51:05,837 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:51:05,837 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:51:05,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:51:05,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:51:05,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:51:05,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:51:05,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:51:05,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:51:05,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:51:05,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:51:05,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:51:05,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:51:05,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:51:05,840 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:51:05,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:51:05,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:51:05,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:51:05,841 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:51:05,841 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:51:05,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:51:05,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:51:05,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:51:05,906 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:51:05,906 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:51:05,907 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-09-14 15:51:06,252 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1293e793/5bf45efea158420eb5bd9ffd252a8a1a/FLAG349b4bee8 [2018-09-14 15:51:06,387 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:51:06,388 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-09-14 15:51:06,393 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1293e793/5bf45efea158420eb5bd9ffd252a8a1a/FLAG349b4bee8 [2018-09-14 15:51:06,411 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1293e793/5bf45efea158420eb5bd9ffd252a8a1a [2018-09-14 15:51:06,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:51:06,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:51:06,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:51:06,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:51:06,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:51:06,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714817d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06, skipping insertion in model container [2018-09-14 15:51:06,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,458 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:51:06,642 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:51:06,659 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:51:06,667 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:51:06,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06 WrapperNode [2018-09-14 15:51:06,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:51:06,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:51:06,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:51:06,681 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:51:06,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:51:06,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:51:06,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:51:06,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:51:06,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (1/1) ... [2018-09-14 15:51:06,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:51:06,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:51:06,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:51:06,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:51:06,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (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-14 15:51:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:51:06,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:51:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:51:06,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:51:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:51:06,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:51:06,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 15:51:06,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 15:51:07,252 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:51:07,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:51:07 BoogieIcfgContainer [2018-09-14 15:51:07,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:51:07,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:51:07,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:51:07,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:51:07,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:51:06" (1/3) ... [2018-09-14 15:51:07,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e0244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:51:07, skipping insertion in model container [2018-09-14 15:51:07,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:51:06" (2/3) ... [2018-09-14 15:51:07,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e0244e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:51:07, skipping insertion in model container [2018-09-14 15:51:07,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:51:07" (3/3) ... [2018-09-14 15:51:07,261 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-09-14 15:51:07,271 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:51:07,279 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:51:07,322 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:51:07,322 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:51:07,323 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:51:07,323 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:51:07,323 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:51:07,323 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:51:07,323 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:51:07,323 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:51:07,324 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:51:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-09-14 15:51:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-14 15:51:07,349 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:07,350 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:07,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1899131806, now seen corresponding path program 1 times [2018-09-14 15:51:07,360 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:07,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:07,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:07,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:07,410 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:07,569 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-14 15:51:07,571 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:51:07,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 15:51:07,572 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 15:51:07,587 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 15:51:07,587 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-14 15:51:07,590 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-09-14 15:51:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:07,736 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2018-09-14 15:51:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 15:51:07,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-09-14 15:51:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:07,746 INFO L225 Difference]: With dead ends: 61 [2018-09-14 15:51:07,746 INFO L226 Difference]: Without dead ends: 32 [2018-09-14 15:51:07,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:51:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-14 15:51:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-14 15:51:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-14 15:51:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-09-14 15:51:07,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-09-14 15:51:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:07,789 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-09-14 15:51:07,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 15:51:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-09-14 15:51:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-14 15:51:07,791 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:07,791 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:07,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1651874812, now seen corresponding path program 1 times [2018-09-14 15:51:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:07,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:07,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:07,794 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:08,044 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-14 15:51:08,044 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:08,045 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-14 15:51:08,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:08,063 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:08,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:08,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:08,870 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-14 15:51:08,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 15:51:08,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 16 [2018-09-14 15:51:08,901 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:08,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 15:51:08,902 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 15:51:08,903 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:51:08,903 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-09-14 15:51:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:09,113 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-09-14 15:51:09,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:51:09,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-09-14 15:51:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:09,116 INFO L225 Difference]: With dead ends: 46 [2018-09-14 15:51:09,116 INFO L226 Difference]: Without dead ends: 44 [2018-09-14 15:51:09,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-09-14 15:51:09,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-14 15:51:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-09-14 15:51:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-14 15:51:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-09-14 15:51:09,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2018-09-14 15:51:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:09,126 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-09-14 15:51:09,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 15:51:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-09-14 15:51:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-14 15:51:09,128 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:09,128 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:09,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1162553418, now seen corresponding path program 1 times [2018-09-14 15:51:09,129 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:09,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:09,136 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:09,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:09,349 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 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-09-14 15:51:09,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:09,370 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:09,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:09,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:09,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:09,811 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 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:09,830 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:09,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:09,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:51:09,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:09,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 10 [2018-09-14 15:51:09,980 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 15:51:09,981 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 15:51:09,982 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-14 15:51:09,982 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-09-14 15:51:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:10,365 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-09-14 15:51:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 15:51:10,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-09-14 15:51:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:10,369 INFO L225 Difference]: With dead ends: 82 [2018-09-14 15:51:10,370 INFO L226 Difference]: Without dead ends: 59 [2018-09-14 15:51:10,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-09-14 15:51:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-14 15:51:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-09-14 15:51:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-14 15:51:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-09-14 15:51:10,386 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2018-09-14 15:51:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:10,387 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-09-14 15:51:10,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 15:51:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-09-14 15:51:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-14 15:51:10,390 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:10,390 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:10,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1325122332, now seen corresponding path program 1 times [2018-09-14 15:51:10,391 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:10,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:10,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:10,392 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-14 15:51:10,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:10,511 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:51:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:10,520 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:51:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:10,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-14 15:51:10,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 15:51:10,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 15:51:10,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-09-14 15:51:10,713 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:51:10,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:51:10,714 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:51:10,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-14 15:51:10,716 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 6 states. [2018-09-14 15:51:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:11,014 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-09-14 15:51:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 15:51:11,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-09-14 15:51:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:11,017 INFO L225 Difference]: With dead ends: 86 [2018-09-14 15:51:11,018 INFO L226 Difference]: Without dead ends: 54 [2018-09-14 15:51:11,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-14 15:51:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-14 15:51:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-09-14 15:51:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-14 15:51:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-09-14 15:51:11,030 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2018-09-14 15:51:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:11,033 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-09-14 15:51:11,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:51:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-09-14 15:51:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-14 15:51:11,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:51:11,035 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:51:11,035 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:51:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -908739042, now seen corresponding path program 2 times [2018-09-14 15:51:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:51:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:51:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:51:11,038 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:51:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:51:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 15:51:11,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:11,196 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-14 15:51:11,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:11,206 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:11,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-14 15:51:11,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:11,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-14 15:51:11,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-14 15:51:11,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:51:11,444 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 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:51:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:51:11,460 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:51:11,479 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-14 15:51:11,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:11,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-14 15:51:11,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-14 15:51:11,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:51:11,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7, 7, 7] total 19 [2018-09-14 15:51:11,630 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:51:11,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-14 15:51:11,631 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-14 15:51:11,636 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-14 15:51:11,636 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 16 states. [2018-09-14 15:51:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:51:12,564 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-09-14 15:51:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-14 15:51:12,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-09-14 15:51:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:51:12,566 INFO L225 Difference]: With dead ends: 105 [2018-09-14 15:51:12,566 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 15:51:12,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-09-14 15:51:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 15:51:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 15:51:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 15:51:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 15:51:12,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-09-14 15:51:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:51:12,570 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 15:51:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-14 15:51:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 15:51:12,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 15:51:12,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 15:51:12,789 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-14 15:51:13,044 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-09-14 15:51:13,265 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-09-14 15:51:13,295 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:51:13,295 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:51:13,296 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:51:13,296 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 15:51:13,296 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-14 15:51:13,296 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 15:51:13,296 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 15:51:13,296 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-09-14 15:51:13,297 INFO L422 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (+ main_~k~0 2) .cse2))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) .cse1) (and (<= 2 main_~i~0) (< main_~j~0 .cse2) .cse0 (<= (* 2 main_~i~0) main_~j~0) .cse1)))) [2018-09-14 15:51:13,297 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2018-09-14 15:51:13,297 INFO L426 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-09-14 15:51:13,297 INFO L426 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-09-14 15:51:13,297 INFO L429 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-09-14 15:51:13,297 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 23) no Hoare annotation was computed. [2018-09-14 15:51:13,297 INFO L426 ceAbstractionStarter]: For program point L20-3(lines 20 23) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L426 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L422 ceAbstractionStarter]: At program point L20-4(lines 20 23) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~j~0 (* 2 main_~i~0))) (<= 2 main_~i~0) (and (<= 0 main_~i~0) (<= main_~i~0 0))) [2018-09-14 15:51:13,298 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L426 ceAbstractionStarter]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L426 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L422 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse4 (* 2 main_~i~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse3 (<= main_~j~0 .cse4)) (.cse1 (< main_~i~0 main_~n~0)) (.cse2 (<= .cse4 main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= main_~j~0 (+ main_~k~0 1)) .cse2) (and (<= (* 3 main_~i~0) main_~j~0) (<= 0 main_~i~0) .cse1 .cse3) (and (<= 2 main_~i~0) .cse1 .cse2)))) [2018-09-14 15:51:13,298 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-09-14 15:51:13,298 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-09-14 15:51:13,299 INFO L426 ceAbstractionStarter]: For program point L22-1(lines 22 23) no Hoare annotation was computed. [2018-09-14 15:51:13,299 INFO L422 ceAbstractionStarter]: At program point L22-3(lines 22 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~i~0) main_~j~0))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) (<= (+ main_~k~0 2) .cse1)) (and (<= 2 main_~i~0) (< main_~j~0 .cse1) .cse0 .cse2) (and (<= 1 main_~i~0) (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0))) .cse0 .cse2))) [2018-09-14 15:51:13,299 INFO L426 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-09-14 15:51:13,299 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-14 15:51:13,299 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:51:13,299 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-14 15:51:13,300 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-14 15:51:13,300 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-14 15:51:13,300 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-14 15:51:13,314 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,315 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,315 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,316 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,316 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,316 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,317 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,317 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,317 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,319 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,320 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,320 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,320 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,320 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,321 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,321 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,321 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,321 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:51:13 BoogieIcfgContainer [2018-09-14 15:51:13,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:51:13,325 INFO L168 Benchmark]: Toolchain (without parser) took 6898.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -378.6 MB). Peak memory consumption was 350.2 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:13,327 INFO L168 Benchmark]: CDTParser took 0.19 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-14 15:51:13,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.31 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-14 15:51:13,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.07 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-14 15:51:13,329 INFO L168 Benchmark]: Boogie Preprocessor took 20.75 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-14 15:51:13,329 INFO L168 Benchmark]: RCFGBuilder took 528.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:13,330 INFO L168 Benchmark]: TraceAbstraction took 6070.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 402.9 MB). Peak memory consumption was 402.9 MB. Max. memory is 7.1 GB. [2018-09-14 15:51:13,335 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.19 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 248.31 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 22.07 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 20.75 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 528.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6070.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 402.9 MB). Peak memory consumption was 402.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 21]: Loop Invariant Derived loop invariant: (((((1 <= i && i < n) && 2 * i <= j) && j <= 2 * i) || (((1 <= i && i < n) && j <= k + 1) && 2 * i <= j)) || (((3 * i <= j && 0 <= i) && i < n) && j <= 2 * i)) || ((2 <= i && i < n) && 2 * i <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-09-14 15:51:13,347 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,347 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,348 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,348 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,348 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,348 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,349 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,349 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,349 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,351 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,351 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,351 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,352 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,352 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,352 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,352 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,352 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-09-14 15:51:13,353 WARN L382 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: ((((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i) || (((2 <= i && j < 3 * i) && i < n) && 2 * i <= j)) || (((1 <= i && (\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k)) && i < n) && 2 * i <= j) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((1 <= i && j <= 2 * i) || 2 <= i) || (0 <= i && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 136 SDtfs, 143 SDslu, 518 SDs, 0 SdLazy, 478 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 454 SyntacticMatches, 13 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, 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, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 45 NumberOfFragments, 240 HoareAnnotationTreeSize, 22 FomulaSimplifications, 503 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 419 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 644 ConstructedInterpolants, 21 QuantifiedInterpolants, 68436 SizeOfPredicates, 26 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 298/356 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/nested9_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_15-51-13-359.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested9_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_15-51-13-359.csv Received shutdown request...