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/loops/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:08:49,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:08:49,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:08:49,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:08:49,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:08:49,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:08:49,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:08:49,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:08:49,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:08:49,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:08:49,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:08:49,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:08:49,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:08:49,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:08:49,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:08:49,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:08:49,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:08:49,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:08:49,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:08:49,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:08:49,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:08:49,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:08:49,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:08:49,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:08:49,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:08:49,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:08:49,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:08:49,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:08:49,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:08:49,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:08:49,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:08:49,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:08:49,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:08:49,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:08:49,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:08:49,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:08:49,645 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:08:49,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:08:49,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:08:49,675 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:08:49,675 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:08:49,675 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:08:49,675 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:08:49,676 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:08:49,676 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:08:49,676 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:08:49,677 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:08:49,677 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:08:49,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:08:49,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:08:49,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:08:49,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:08:49,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:08:49,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:08:49,682 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:08:49,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:08:49,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:08:49,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:08:49,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:08:49,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:08:49,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:08:49,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:08:49,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:08:49,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:08:49,686 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:08:49,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:08:49,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:08:49,687 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:08:49,687 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:08:49,687 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:08:49,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:08:49,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:08:49,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:08:49,761 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:08:49,762 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:08:49,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-09-10 10:08:50,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0130c3c0/396e17f0bcc749dc90cc92dedd6ea183/FLAG5dcd57e0e [2018-09-10 10:08:50,253 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:08:50,253 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-09-10 10:08:50,261 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0130c3c0/396e17f0bcc749dc90cc92dedd6ea183/FLAG5dcd57e0e [2018-09-10 10:08:50,278 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0130c3c0/396e17f0bcc749dc90cc92dedd6ea183 [2018-09-10 10:08:50,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:08:50,296 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:08:50,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:08:50,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:08:50,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a947579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50, skipping insertion in model container [2018-09-10 10:08:50,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,494 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:08:50,533 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,558 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:08:50,566 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50 WrapperNode [2018-09-10 10:08:50,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:08:50,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:08:50,595 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:08:50" (1/1) ... [2018-09-10 10:08:50,605 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:08:50" (1/1) ... [2018-09-10 10:08:50,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:08:50,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:08:50,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:08:50,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:08:50,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:08:50,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (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:08:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:08:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:08:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i__linear_search [2018-09-10 10:08:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i__linear_search [2018-09-10 10:08:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assert [2018-09-10 10:08:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assert [2018-09-10 10:08:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:08:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:08:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:08:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:08:51,211 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:08:51,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:51 BoogieIcfgContainer [2018-09-10 10:08:51,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:08:51,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:08:51,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:08:51,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:08:51,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:08:50" (1/3) ... [2018-09-10 10:08:51,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4918afb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:51, skipping insertion in model container [2018-09-10 10:08:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (2/3) ... [2018-09-10 10:08:51,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4918afb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:51, skipping insertion in model container [2018-09-10 10:08:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:51" (3/3) ... [2018-09-10 10:08:51,225 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-09-10 10:08:51,236 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:08:51,246 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:08:51,298 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:08:51,299 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:08:51,299 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:08:51,300 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:08:51,300 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:08:51,300 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:08:51,300 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:08:51,300 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:08:51,300 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:08:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-10 10:08:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-10 10:08:51,328 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,331 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,332 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1185499889, now seen corresponding path program 1 times [2018-09-10 10:08:51,340 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,394 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,548 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:08:51,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:08:51,551 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:08:51,572 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:08:51,573 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:08:51,575 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-09-10 10:08:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,601 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-09-10 10:08:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:08:51,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-09-10 10:08:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,612 INFO L225 Difference]: With dead ends: 44 [2018-09-10 10:08:51,612 INFO L226 Difference]: Without dead ends: 21 [2018-09-10 10:08:51,617 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:08:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-10 10:08:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-10 10:08:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-10 10:08:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-09-10 10:08:51,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-09-10 10:08:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,661 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-09-10 10:08:51,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:08:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-09-10 10:08:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-10 10:08:51,662 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,663 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] [2018-09-10 10:08:51,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2111077520, now seen corresponding path program 1 times [2018-09-10 10:08:51,664 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,666 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,086 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:08:52,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:52,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:08:52,087 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:52,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:08:52,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:08:52,089 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:08:52,090 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-09-10 10:08:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:52,194 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-10 10:08:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:08:52,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-09-10 10:08:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:52,196 INFO L225 Difference]: With dead ends: 29 [2018-09-10 10:08:52,196 INFO L226 Difference]: Without dead ends: 21 [2018-09-10 10:08:52,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-10 10:08:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-10 10:08:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-10 10:08:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-10 10:08:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-10 10:08:52,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-09-10 10:08:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:52,203 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-10 10:08:52,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:08:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-10 10:08:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-10 10:08:52,204 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:52,204 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] [2018-09-10 10:08:52,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash -441079441, now seen corresponding path program 1 times [2018-09-10 10:08:52,205 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:52,207 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,550 WARN L175 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-09-10 10:08:52,738 WARN L175 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-09-10 10:08:52,800 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:08:52,800 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:52,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 10:08:52,801 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:52,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:08:52,801 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:08:52,802 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:08:52,802 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-09-10 10:08:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:53,142 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-09-10 10:08:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:08:53,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-09-10 10:08:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:53,147 INFO L225 Difference]: With dead ends: 38 [2018-09-10 10:08:53,147 INFO L226 Difference]: Without dead ends: 29 [2018-09-10 10:08:53,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:08:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-10 10:08:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-09-10 10:08:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-10 10:08:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-10 10:08:53,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2018-09-10 10:08:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:53,158 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-10 10:08:53,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:08:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-10 10:08:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-10 10:08:53,161 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:53,161 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] [2018-09-10 10:08:53,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -834106451, now seen corresponding path program 1 times [2018-09-10 10:08:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,164 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:53,556 WARN L175 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-09-10 10:08:53,666 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:08:53,666 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:53,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:08:53,667 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:53,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:08:53,668 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:08:53,668 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:08:53,669 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-09-10 10:08:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:53,784 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-09-10 10:08:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:08:53,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-10 10:08:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:53,786 INFO L225 Difference]: With dead ends: 35 [2018-09-10 10:08:53,787 INFO L226 Difference]: Without dead ends: 26 [2018-09-10 10:08:53,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:08:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-10 10:08:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-10 10:08:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-10 10:08:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-10 10:08:53,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2018-09-10 10:08:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:53,795 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-10 10:08:53,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:08:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-10 10:08:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-10 10:08:53,796 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:53,796 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] [2018-09-10 10:08:53,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1786013849, now seen corresponding path program 1 times [2018-09-10 10:08:53,797 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:53,799 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,506 WARN L175 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-09-10 10:08:54,639 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:08:54,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:54,640 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:08:54,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:54,659 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:54,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-09-10 10:08:54,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:08:54,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-09-10 10:08:54,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:08:54,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:55,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:55,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-09-10 10:08:55,722 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:08:55,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,925 WARN L175 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-09-10 10:08:58,116 WARN L175 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-09-10 10:09:03,510 WARN L175 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 33 [2018-09-10 10:09:05,352 WARN L175 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 41 [2018-09-10 10:09:05,428 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:05,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:05,450 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:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:05,468 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:05,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:08,063 WARN L175 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-09-10 10:09:11,959 WARN L175 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:09:14,139 WARN L175 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 25 [2018-09-10 10:09:16,189 WARN L175 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-09-10 10:09:16,256 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:16,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:16,737 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:16,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:16,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9, 8, 7] total 31 [2018-09-10 10:09:16,743 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:16,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:09:16,744 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:09:16,748 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=794, Unknown=3, NotChecked=0, Total=930 [2018-09-10 10:09:16,749 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-09-10 10:09:17,509 WARN L175 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-09-10 10:09:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:18,359 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-09-10 10:09:18,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 10:09:18,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-10 10:09:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:18,366 INFO L225 Difference]: With dead ends: 54 [2018-09-10 10:09:18,366 INFO L226 Difference]: Without dead ends: 39 [2018-09-10 10:09:18,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=300, Invalid=1503, Unknown=3, NotChecked=0, Total=1806 [2018-09-10 10:09:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-10 10:09:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-09-10 10:09:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-10 10:09:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-09-10 10:09:18,376 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2018-09-10 10:09:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:18,376 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-09-10 10:09:18,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:09:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-09-10 10:09:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-10 10:09:18,378 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:18,378 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] [2018-09-10 10:09:18,378 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 381869589, now seen corresponding path program 1 times [2018-09-10 10:09:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:18,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:18,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:18,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:18,380 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:18,444 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-10 10:09:18,444 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:18,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:18,445 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:18,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:18,445 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:18,445 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:18,446 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-09-10 10:09:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:18,493 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-10 10:09:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:18,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-10 10:09:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:18,496 INFO L225 Difference]: With dead ends: 49 [2018-09-10 10:09:18,496 INFO L226 Difference]: Without dead ends: 30 [2018-09-10 10:09:18,497 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:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-10 10:09:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-10 10:09:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-10 10:09:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-09-10 10:09:18,503 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-09-10 10:09:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:18,504 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-09-10 10:09:18,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-09-10 10:09:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-10 10:09:18,505 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:18,505 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:18,505 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash -435453245, now seen corresponding path program 2 times [2018-09-10 10:09:18,506 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:18,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:18,507 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:18,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:18,812 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:18,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:18,822 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:18,850 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-10 10:09:18,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:18,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:09:19,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:09:19,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:19,360 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:19,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:09:19,379 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:09:19,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-10 10:09:19,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:09:19,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:22,765 WARN L175 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-09-10 10:09:31,156 WARN L175 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 24 [2018-09-10 10:09:33,301 WARN L175 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 10:09:35,596 WARN L175 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 23 [2018-09-10 10:09:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:09:35,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-10 10:09:36,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:36,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 7, 6] total 24 [2018-09-10 10:09:36,598 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:36,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-10 10:09:36,598 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-10 10:09:36,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=444, Unknown=2, NotChecked=0, Total=552 [2018-09-10 10:09:36,599 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 12 states. [2018-09-10 10:09:38,815 WARN L175 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-09-10 10:09:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:51,539 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-09-10 10:09:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 10:09:51,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-09-10 10:09:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:51,541 INFO L225 Difference]: With dead ends: 50 [2018-09-10 10:09:51,541 INFO L226 Difference]: Without dead ends: 38 [2018-09-10 10:09:51,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=231, Invalid=883, Unknown=8, NotChecked=0, Total=1122 [2018-09-10 10:09:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-10 10:09:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-09-10 10:09:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-10 10:09:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-10 10:09:51,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2018-09-10 10:09:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-10 10:09:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-10 10:09:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-10 10:09:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-10 10:09:51,548 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:51,548 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:51,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash -828480255, now seen corresponding path program 1 times [2018-09-10 10:09:51,549 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:51,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:09:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:51,550 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:53,953 WARN L175 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 119 DAG size of output: 33 [2018-09-10 10:09:54,153 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2018-09-10 10:09:54,582 WARN L175 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-09-10 10:10:05,086 WARN L175 SmtUtils]: Spent 10.12 s on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2018-09-10 10:10:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:05,093 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:05,094 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:10:05,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:05,107 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:10:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:05,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:05,169 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:10:05,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:05,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-09-10 10:10:05,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:10:05,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:05,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:05,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:05,293 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-09-10 10:10:09,310 WARN L175 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-09-10 10:10:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:09,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:09,578 WARN L175 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2018-09-10 10:10:12,565 WARN L175 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-09-10 10:10:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:13,000 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:13,001 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-10 10:10:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:13,017 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:10:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:13,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:13,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:10:13,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:10:13,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-09-10 10:10:13,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:10:13,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:10:13,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:10:13,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,222 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-09-10 10:10:13,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:10:13,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,248 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:10:13,248 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,249 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:10:13,249 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-10 10:10:13,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-10 10:10:13,351 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-09-10 10:10:13,845 WARN L175 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-09-10 10:10:15,563 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-10 10:10:15,995 WARN L175 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-09-10 10:10:21,082 WARN L175 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-09-10 10:10:25,855 WARN L175 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 55 [2018-09-10 10:10:26,580 WARN L175 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-09-10 10:10:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:26,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:27,182 WARN L175 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2018-09-10 10:10:27,370 WARN L175 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-09-10 10:10:34,462 WARN L175 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-09-10 10:10:35,042 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-10 10:10:35,460 WARN L175 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-09-10 10:10:35,794 WARN L175 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-10 10:10:38,285 WARN L175 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-09-10 10:10:38,983 WARN L175 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-09-10 10:10:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:39,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:39,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 14, 13] total 54 [2018-09-10 10:10:39,055 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:39,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-10 10:10:39,058 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-10 10:10:39,060 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2543, Unknown=7, NotChecked=0, Total=2862 [2018-09-10 10:10:39,060 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 21 states. [2018-09-10 10:10:49,947 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-09-10 10:10:50,145 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-09-10 10:10:50,557 WARN L175 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-09-10 10:10:51,658 WARN L175 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2018-09-10 10:10:54,244 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2018-09-10 10:10:56,014 WARN L175 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 62 [2018-09-10 10:10:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:56,189 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-10 10:10:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 10:10:56,190 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-09-10 10:10:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:56,192 INFO L225 Difference]: With dead ends: 44 [2018-09-10 10:10:56,192 INFO L226 Difference]: Without dead ends: 34 [2018-09-10 10:10:56,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=457, Invalid=3564, Unknown=11, NotChecked=0, Total=4032 [2018-09-10 10:10:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-10 10:10:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-10 10:10:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-10 10:10:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-10 10:10:56,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-10 10:10:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:56,200 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-10 10:10:56,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-10 10:10:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-10 10:10:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-10 10:10:56,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:56,201 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:56,201 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash 392714795, now seen corresponding path program 2 times [2018-09-10 10:10:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:56,202 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:56,573 WARN L175 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 38 [2018-09-10 10:10:56,842 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-09-10 10:10:59,270 WARN L175 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-09-10 10:11:01,919 WARN L175 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-09-10 10:11:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:01,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:01,929 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:11:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:11:01,938 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:11:02,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:11:02,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:11:02,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:02,071 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:11:02,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:02,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-09-10 10:11:02,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:11:02,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:02,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:02,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:02,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-09-10 10:11:02,797 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-10 10:11:03,724 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-10 10:11:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:04,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:04,341 WARN L175 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-09-10 10:11:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:06,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:06,188 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 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:11:06,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:11:06,204 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:11:06,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:11:06,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:11:06,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:06,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-09-10 10:11:06,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:11:06,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:06,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:06,430 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:11:06,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:06,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:11:06,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:11:06,441 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:11:08,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:11:08,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,495 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:11:08,495 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-09-10 10:11:08,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:11:08,503 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-10 10:11:08,521 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:11:12,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-10 10:11:12,621 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-09-10 10:11:22,784 WARN L175 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2018-09-10 10:11:25,940 WARN L175 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-09-10 10:11:28,212 WARN L175 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2018-09-10 10:11:28,963 WARN L175 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-09-10 10:11:30,840 WARN L175 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 51 [2018-09-10 10:11:32,198 WARN L175 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 49 [2018-09-10 10:11:34,541 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-09-10 10:11:36,539 WARN L175 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-09-10 10:11:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:36,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:37,197 WARN L175 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2018-09-10 10:11:37,393 WARN L175 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-09-10 10:11:38,436 WARN L175 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-09-10 10:11:39,051 WARN L175 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-09-10 10:11:39,410 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-10 10:11:39,786 WARN L175 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-09-10 10:11:40,229 WARN L175 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-09-10 10:11:40,898 WARN L175 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-09-10 10:11:43,520 WARN L175 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-09-10 10:11:44,125 WARN L175 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-09-10 10:11:44,994 WARN L175 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-09-10 10:11:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:45,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:11:45,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14, 17, 16] total 65 [2018-09-10 10:11:45,066 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:11:45,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-10 10:11:45,066 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-10 10:11:45,070 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=3797, Unknown=3, NotChecked=0, Total=4160 [2018-09-10 10:11:45,070 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-09-10 10:11:45,582 WARN L175 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-09-10 10:11:46,366 WARN L175 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2018-09-10 10:11:49,375 WARN L175 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2018-09-10 10:11:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:11:51,751 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-10 10:11:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 10:11:51,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-09-10 10:11:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:11:51,753 INFO L225 Difference]: With dead ends: 48 [2018-09-10 10:11:51,753 INFO L226 Difference]: Without dead ends: 38 [2018-09-10 10:11:51,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=468, Invalid=4930, Unknown=4, NotChecked=0, Total=5402 [2018-09-10 10:11:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-10 10:11:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-10 10:11:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-10 10:11:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-10 10:11:51,761 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-10 10:11:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:11:51,761 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-10 10:11:51,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-10 10:11:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-10 10:11:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-10 10:11:51,762 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:11:51,762 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:11:51,763 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:11:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1384098389, now seen corresponding path program 3 times [2018-09-10 10:11:51,763 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:11:51,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:51,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:11:51,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:51,764 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:11:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:54,061 WARN L175 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2018-09-10 10:11:54,317 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-09-10 10:11:54,563 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2018-09-10 10:11:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:55,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:55,191 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:11:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:11:55,206 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:12:30,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-10 10:12:30,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-09-10 10:12:30,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:12:30,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-10 10:12:30,447 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:12:30,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 10:12:30,448 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 10:12:30,448 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:12:30,448 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 14 states. [2018-09-10 10:12:31,045 WARN L175 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-09-10 10:12:31,263 WARN L175 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2018-09-10 10:12:31,474 WARN L175 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-09-10 10:12:31,780 WARN L175 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-09-10 10:12:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:12:31,832 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-10 10:12:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 10:12:31,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-09-10 10:12:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:12:31,834 INFO L225 Difference]: With dead ends: 52 [2018-09-10 10:12:31,834 INFO L226 Difference]: Without dead ends: 42 [2018-09-10 10:12:31,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-09-10 10:12:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-10 10:12:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-10 10:12:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-10 10:12:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-10 10:12:31,843 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-10 10:12:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:12:31,843 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-10 10:12:31,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 10:12:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-10 10:12:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-10 10:12:31,844 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:12:31,845 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:12:31,845 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:12:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1816210049, now seen corresponding path program 4 times [2018-09-10 10:12:31,845 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:12:31,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:12:31,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:12:31,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:12:31,846 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:12:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:12:32,528 WARN L175 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 38 [2018-09-10 10:12:32,829 WARN L175 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-09-10 10:12:33,112 WARN L175 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-09-10 10:12:35,579 WARN L175 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2018-09-10 10:12:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:12:35,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:12:35,591 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:12:35,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:12:35,599 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:12:35,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:12:35,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:12:35,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:12:35,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-09-10 10:12:35,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:12:35,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:12:35,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:35,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-09-10 10:12:35,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:12:35,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:12:35,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:39,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:39,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-09-10 10:12:41,127 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-10 10:12:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:12:41,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:12:41,959 WARN L175 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 100 [2018-09-10 10:12:44,771 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-09-10 10:12:45,089 WARN L175 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-10 10:12:45,548 WARN L175 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-09-10 10:12:45,992 WARN L175 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-09-10 10:12:46,483 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-09-10 10:12:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:12:46,545 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:12:46,545 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 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:12:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:12:46,561 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:12:46,779 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:12:46,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:12:46,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:12:46,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-09-10 10:12:46,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:12:46,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:12:46,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:46,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-09-10 10:12:46,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:12:46,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:12:46,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:46,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:12:46,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-09-10 10:12:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:12:48,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:12:48,874 WARN L175 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-09-10 10:12:50,028 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-09-10 10:12:51,389 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-10 10:12:52,222 WARN L175 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-10 10:12:52,614 WARN L175 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-09-10 10:12:53,186 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-09-10 10:12:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:12:53,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:12:53,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 18, 16, 15] total 72 [2018-09-10 10:12:53,222 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:12:53,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-10 10:12:53,223 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-10 10:12:53,225 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=4768, Unknown=0, NotChecked=0, Total=5112 [2018-09-10 10:12:53,225 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 31 states. [2018-09-10 10:12:53,867 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-09-10 10:12:54,555 WARN L175 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-09-10 10:12:55,109 WARN L175 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-09-10 10:12:56,093 WARN L175 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-09-10 10:12:57,241 WARN L175 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-09-10 10:12:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:12:58,257 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-10 10:12:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-10 10:12:58,258 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-09-10 10:12:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:12:58,259 INFO L225 Difference]: With dead ends: 56 [2018-09-10 10:12:58,259 INFO L226 Difference]: Without dead ends: 46 [2018-09-10 10:12:58,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1815 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=495, Invalid=6645, Unknown=0, NotChecked=0, Total=7140 [2018-09-10 10:12:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-10 10:12:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-10 10:12:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-10 10:12:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-10 10:12:58,269 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-10 10:12:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:12:58,269 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-10 10:12:58,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-10 10:12:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-10 10:12:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-10 10:12:58,270 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:12:58,271 INFO L376 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:12:58,271 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_linear_sea_ch_true_unreach_call_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:12:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2109758377, now seen corresponding path program 5 times [2018-09-10 10:12:58,271 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:12:58,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:12:58,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:12:58,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:12:58,272 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:12:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:02,565 WARN L175 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 119 DAG size of output: 31 [2018-09-10 10:13:02,983 WARN L175 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-09-10 10:13:03,307 WARN L175 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-09-10 10:13:09,961 WARN L175 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 78 DAG size of output: 35 [2018-09-10 10:13:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:09,976 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:09,976 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:13:09,986 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:13:14,189 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-10 10:13:14,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:14,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:14,210 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:13:14,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-09-10 10:13:14,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:13:14,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-09-10 10:13:14,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:13:14,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:13:14,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:13:14,275 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,293 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-10 10:13:14,294 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-09-10 10:13:14,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-10 10:13:14,301 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:13:14,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-10 10:13:14,417 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:445, output treesize:66 [2018-09-10 10:13:22,549 WARN L175 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 Received shutdown request... [2018-09-10 10:13:23,663 WARN L175 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 24 [2018-09-10 10:13:23,664 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-10 10:13:23,865 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:23,866 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-10 10:13:23,871 WARN L206 ceAbstractionStarter]: Timeout [2018-09-10 10:13:23,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:13:23 BoogieIcfgContainer [2018-09-10 10:13:23,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:13:23,872 INFO L168 Benchmark]: Toolchain (without parser) took 273580.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 903.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.1 MB). Peak memory consumption was 646.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:23,873 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:13:23,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.50 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:13:23,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.95 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:13:23,874 INFO L168 Benchmark]: Boogie Preprocessor took 34.42 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:13:23,874 INFO L168 Benchmark]: RCFGBuilder took 549.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:23,875 INFO L168 Benchmark]: TraceAbstraction took 272658.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 514.1 MB). Peak memory consumption was 677.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:23,877 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.50 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 41.95 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 34.42 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 549.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 272658.41 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 514.1 MB). Peak memory consumption was 677.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. TIMEOUT Result, 272.5s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 47.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 224 SDtfs, 269 SDslu, 1435 SDs, 0 SdLazy, 1678 SolverSat, 76 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 405 SyntacticMatches, 33 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 182.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=11, 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, 11 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 36.3s SatisfiabilityAnalysisTime, 162.2s InterpolantComputationTime, 629 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 866 ConstructedInterpolants, 225 QuantifiedInterpolants, 1270348 SizeOfPredicates, 179 NumberOfNonLiveVariables, 1468 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 36/604 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_sea.ch_true-unreach-call.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-13-23-887.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_sea.ch_true-unreach-call.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-13-23-887.csv Completed graceful shutdown