java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:39:39,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:39:39,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:39:39,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:39:39,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:39:39,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:39:39,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:39:39,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:39:39,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:39:39,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:39:39,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:39:39,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:39:39,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:39:39,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:39:39,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:39:39,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:39:39,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:39:39,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:39:39,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:39:39,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:39:39,741 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:39:39,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:39:39,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:39:39,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:39:39,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:39:39,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:39:39,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:39:39,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:39:39,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:39:39,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:39:39,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:39:39,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:39:39,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:39:39,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:39:39,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:39:39,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:39:39,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-22 15:39:39,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:39:39,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:39:39,776 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:39:39,776 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-22 15:39:39,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-22 15:39:39,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-22 15:39:39,777 INFO L133 SettingsManager]: * Use SBE=true [2018-10-22 15:39:39,777 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:39:39,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:39:39,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:39:39,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:39:39,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:39:39,779 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:39:39,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:39:39,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:39:39,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:39:39,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:39:39,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:39:39,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-22 15:39:39,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:39:39,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:39:39,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:39:39,781 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:39:39,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:39:39,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:39:39,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:39:39,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:39:39,848 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:39:39,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-10-22 15:39:39,913 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/163946d44/40069bb0746f4fe7925b7456fc7a4dd9/FLAGff5e75c3c [2018-10-22 15:39:40,411 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:39:40,414 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-10-22 15:39:40,423 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/163946d44/40069bb0746f4fe7925b7456fc7a4dd9/FLAGff5e75c3c [2018-10-22 15:39:40,445 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/163946d44/40069bb0746f4fe7925b7456fc7a4dd9 [2018-10-22 15:39:40,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:39:40,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:39:40,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:39:40,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:39:40,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:39:40,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5144482c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40, skipping insertion in model container [2018-10-22 15:39:40,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:39:40,516 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:39:40,694 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:39:40,698 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:39:40,726 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:39:40,749 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:39:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40 WrapperNode [2018-10-22 15:39:40,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:39:40,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:39:40,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:39:40,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:39:40,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:39:40,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:39:40,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:39:40,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:39:40,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... [2018-10-22 15:39:40,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:39:40,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:39:40,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:39:40,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:39:40,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:39:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-22 15:39:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-22 15:39:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:39:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:39:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-22 15:39:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-22 15:39:41,609 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:39:41,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:39:41 BoogieIcfgContainer [2018-10-22 15:39:41,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:39:41,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:39:41,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:39:41,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:39:41,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:39:40" (1/3) ... [2018-10-22 15:39:41,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:39:41, skipping insertion in model container [2018-10-22 15:39:41,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:39:40" (2/3) ... [2018-10-22 15:39:41,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:39:41, skipping insertion in model container [2018-10-22 15:39:41,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:39:41" (3/3) ... [2018-10-22 15:39:41,618 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_true-unreach-call.i [2018-10-22 15:39:41,628 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:39:41,637 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:39:41,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:39:41,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:39:41,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:39:41,691 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:39:41,691 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:39:41,691 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:39:41,691 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:39:41,691 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:39:41,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:39:41,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:39:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-10-22 15:39:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-22 15:39:41,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:41,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:41,724 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:41,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -591883500, now seen corresponding path program 1 times [2018-10-22 15:39:41,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:41,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:41,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:39:41,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:39:41,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:39:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:39:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:39:41,905 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-10-22 15:39:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:41,927 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-10-22 15:39:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:39:41,928 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-10-22 15:39:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:41,939 INFO L225 Difference]: With dead ends: 105 [2018-10-22 15:39:41,939 INFO L226 Difference]: Without dead ends: 41 [2018-10-22 15:39:41,943 INFO L605 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-10-22 15:39:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-22 15:39:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-22 15:39:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-22 15:39:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-22 15:39:41,985 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-10-22 15:39:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:41,989 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-22 15:39:41,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:39:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-22 15:39:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-22 15:39:41,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:41,990 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:41,992 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:41,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash 460875127, now seen corresponding path program 1 times [2018-10-22 15:39:41,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:41,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:39:42,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:39:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-22 15:39:42,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 15:39:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 15:39:42,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-22 15:39:42,245 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2018-10-22 15:39:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:42,796 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-10-22 15:39:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 15:39:42,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-22 15:39:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:42,799 INFO L225 Difference]: With dead ends: 109 [2018-10-22 15:39:42,800 INFO L226 Difference]: Without dead ends: 73 [2018-10-22 15:39:42,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:39:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-22 15:39:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2018-10-22 15:39:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-22 15:39:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-10-22 15:39:42,816 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 23 [2018-10-22 15:39:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:42,817 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-10-22 15:39:42,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 15:39:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-10-22 15:39:42,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-22 15:39:42,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:42,821 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:42,822 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:42,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2070922458, now seen corresponding path program 1 times [2018-10-22 15:39:42,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:42,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:42,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:42,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:43,579 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-22 15:39:44,259 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2018-10-22 15:39:45,051 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2018-10-22 15:39:45,377 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-10-22 15:39:45,844 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 19 [2018-10-22 15:39:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 15:39:46,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:46,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:39:46,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:46,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:46,160 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 6 treesize of output 5 [2018-10-22 15:39:46,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-22 15:39:46,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:46,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:46,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-22 15:39:46,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-22 15:39:46,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:46,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:46,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:46,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:39:46,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-10-22 15:39:46,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-10-22 15:39:46,854 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-10-22 15:39:46,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:46,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-10-22 15:39:47,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-10-22 15:39:47,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-10-22 15:39:47,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-22 15:39:47,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-22 15:39:47,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:47,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2018-10-22 15:39:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:39:47,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:47,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-10-22 15:39:47,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:39:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:39:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:39:47,442 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 29 states. [2018-10-22 15:39:49,142 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-22 15:39:50,705 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-10-22 15:39:50,969 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-22 15:39:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:51,968 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-10-22 15:39:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-22 15:39:51,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-22 15:39:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:51,978 INFO L225 Difference]: With dead ends: 203 [2018-10-22 15:39:51,978 INFO L226 Difference]: Without dead ends: 142 [2018-10-22 15:39:51,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=770, Invalid=3012, Unknown=0, NotChecked=0, Total=3782 [2018-10-22 15:39:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-22 15:39:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 83. [2018-10-22 15:39:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-22 15:39:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-10-22 15:39:51,997 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 44 [2018-10-22 15:39:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:51,997 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-10-22 15:39:51,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:39:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-10-22 15:39:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 15:39:52,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:52,000 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:52,001 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:52,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash 302880947, now seen corresponding path program 2 times [2018-10-22 15:39:52,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:52,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:52,546 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-22 15:39:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-22 15:39:52,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:52,586 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:39:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:39:52,651 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:39:52,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:39:52,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-22 15:39:52,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:52,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-10-22 15:39:52,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 15:39:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 15:39:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-22 15:39:52,872 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 13 states. [2018-10-22 15:39:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:39:53,523 INFO L93 Difference]: Finished difference Result 245 states and 256 transitions. [2018-10-22 15:39:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:39:53,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-10-22 15:39:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:39:53,532 INFO L225 Difference]: With dead ends: 245 [2018-10-22 15:39:53,532 INFO L226 Difference]: Without dead ends: 190 [2018-10-22 15:39:53,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-22 15:39:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-22 15:39:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-10-22 15:39:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-22 15:39:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-10-22 15:39:53,562 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 72 [2018-10-22 15:39:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:39:53,562 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-10-22 15:39:53,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 15:39:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-10-22 15:39:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-22 15:39:53,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:39:53,571 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:39:53,571 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:39:53,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:39:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash -29713602, now seen corresponding path program 1 times [2018-10-22 15:39:53,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:39:53,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:39:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:53,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:39:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:39:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:55,185 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 31 [2018-10-22 15:39:55,349 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2018-10-22 15:39:55,604 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2018-10-22 15:39:55,741 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2018-10-22 15:39:55,911 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2018-10-22 15:39:56,245 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2018-10-22 15:39:56,448 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-10-22 15:39:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-22 15:39:56,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:39:56,787 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:39:56,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:39:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:39:56,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:39:56,834 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 6 treesize of output 5 [2018-10-22 15:39:56,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:56,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:56,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-22 15:39:56,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:39:56,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:56,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:56,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-22 15:39:56,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:39:57,041 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-10-22 15:39:57,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-22 15:39:57,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-10-22 15:39:57,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2018-10-22 15:39:57,349 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 24 treesize of output 23 [2018-10-22 15:39:57,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-10-22 15:39:57,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-10-22 15:39:57,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-10-22 15:39:57,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-10-22 15:39:57,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-10-22 15:39:57,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2018-10-22 15:39:57,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-22 15:39:57,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-10-22 15:39:57,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-10-22 15:39:57,946 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-22 15:39:57,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-22 15:39:57,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-22 15:39:57,990 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:59, output treesize:21 [2018-10-22 15:39:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:39:58,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:39:58,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2018-10-22 15:39:58,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-22 15:39:58,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-22 15:39:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-10-22 15:39:58,093 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 34 states. [2018-10-22 15:40:00,374 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2018-10-22 15:40:00,547 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-10-22 15:40:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:01,050 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-10-22 15:40:01,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-22 15:40:01,050 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-10-22 15:40:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:01,052 INFO L225 Difference]: With dead ends: 167 [2018-10-22 15:40:01,052 INFO L226 Difference]: Without dead ends: 114 [2018-10-22 15:40:01,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=470, Invalid=2286, Unknown=0, NotChecked=0, Total=2756 [2018-10-22 15:40:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-22 15:40:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2018-10-22 15:40:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-22 15:40:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-10-22 15:40:01,063 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 74 [2018-10-22 15:40:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:01,064 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-10-22 15:40:01,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-22 15:40:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-10-22 15:40:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-22 15:40:01,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:01,065 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:01,066 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:01,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2002832634, now seen corresponding path program 3 times [2018-10-22 15:40:01,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:01,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:01,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:40:01,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:01,646 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-22 15:40:02,124 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 37 [2018-10-22 15:40:03,188 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2018-10-22 15:40:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-22 15:40:03,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:03,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:40:03,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:40:03,584 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 15:40:03,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:03,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:03,622 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 6 treesize of output 5 [2018-10-22 15:40:03,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-22 15:40:03,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-22 15:40:03,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-22 15:40:03,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:03,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:40:03,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:03,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-22 15:40:04,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-22 15:40:04,723 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 36 treesize of output 35 [2018-10-22 15:40:04,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:04,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-10-22 15:40:05,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-10-22 15:40:05,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:05,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-10-22 15:40:05,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2018-10-22 15:40:05,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-10-22 15:40:05,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:05,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:05,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:05,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 104 [2018-10-22 15:40:05,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:05,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:114, output treesize:110 [2018-10-22 15:40:06,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-10-22 15:40:06,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 10 [2018-10-22 15:40:06,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:06,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-22 15:40:06,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:06,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-22 15:40:06,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:06,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:06,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:06,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:5 [2018-10-22 15:40:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:40:06,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:06,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33] total 47 [2018-10-22 15:40:06,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-22 15:40:06,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-22 15:40:06,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1866, Unknown=0, NotChecked=0, Total=2162 [2018-10-22 15:40:06,698 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 47 states. [2018-10-22 15:40:10,402 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-10-22 15:40:10,598 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-10-22 15:40:11,030 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2018-10-22 15:40:11,262 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2018-10-22 15:40:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:16,032 INFO L93 Difference]: Finished difference Result 453 states and 470 transitions. [2018-10-22 15:40:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-22 15:40:16,033 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 86 [2018-10-22 15:40:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:16,036 INFO L225 Difference]: With dead ends: 453 [2018-10-22 15:40:16,036 INFO L226 Difference]: Without dead ends: 402 [2018-10-22 15:40:16,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6161 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2361, Invalid=15999, Unknown=0, NotChecked=0, Total=18360 [2018-10-22 15:40:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-22 15:40:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 206. [2018-10-22 15:40:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-22 15:40:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-10-22 15:40:16,067 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 86 [2018-10-22 15:40:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:16,067 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-10-22 15:40:16,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-22 15:40:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-10-22 15:40:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-22 15:40:16,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:16,070 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:16,070 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:16,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1574955397, now seen corresponding path program 2 times [2018-10-22 15:40:16,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:16,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:40:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:16,828 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-22 15:40:17,459 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-22 15:40:17,646 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2018-10-22 15:40:17,788 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-10-22 15:40:18,762 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2018-10-22 15:40:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-22 15:40:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:19,043 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:40:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:40:19,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:40:19,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:19,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:19,097 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 6 treesize of output 5 [2018-10-22 15:40:19,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-22 15:40:19,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-22 15:40:19,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-22 15:40:19,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:40:19,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-10-22 15:40:19,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-22 15:40:19,424 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 36 treesize of output 35 [2018-10-22 15:40:19,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-10-22 15:40:19,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-10-22 15:40:19,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:19,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-10-22 15:40:19,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:19,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2018-10-22 15:40:20,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-10-22 15:40:20,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:20,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2018-10-22 15:40:20,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-10-22 15:40:20,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 6 [2018-10-22 15:40:20,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:20,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:86, output treesize:6 [2018-10-22 15:40:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:40:20,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:20,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2018-10-22 15:40:20,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-22 15:40:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-22 15:40:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2018-10-22 15:40:20,229 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 42 states. [2018-10-22 15:40:22,859 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-22 15:40:23,656 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-22 15:40:23,837 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-10-22 15:40:24,779 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2018-10-22 15:40:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:26,253 INFO L93 Difference]: Finished difference Result 314 states and 323 transitions. [2018-10-22 15:40:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-22 15:40:26,254 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-10-22 15:40:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:26,255 INFO L225 Difference]: With dead ends: 314 [2018-10-22 15:40:26,255 INFO L226 Difference]: Without dead ends: 238 [2018-10-22 15:40:26,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1179, Invalid=6303, Unknown=0, NotChecked=0, Total=7482 [2018-10-22 15:40:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-22 15:40:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 142. [2018-10-22 15:40:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-22 15:40:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-10-22 15:40:26,272 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 95 [2018-10-22 15:40:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:26,273 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-10-22 15:40:26,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-22 15:40:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-10-22 15:40:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-22 15:40:26,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:26,275 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:26,275 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:26,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1924838217, now seen corresponding path program 4 times [2018-10-22 15:40:26,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:26,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:26,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:40:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-22 15:40:26,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:26,605 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:40:26,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:40:26,650 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:40:26,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:26,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-22 15:40:26,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:26,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-10-22 15:40:26,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-22 15:40:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-22 15:40:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-22 15:40:26,850 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 17 states. [2018-10-22 15:40:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:40:28,007 INFO L93 Difference]: Finished difference Result 398 states and 411 transitions. [2018-10-22 15:40:28,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 15:40:28,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-10-22 15:40:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:40:28,009 INFO L225 Difference]: With dead ends: 398 [2018-10-22 15:40:28,010 INFO L226 Difference]: Without dead ends: 312 [2018-10-22 15:40:28,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-22 15:40:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-22 15:40:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-22 15:40:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-22 15:40:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 251 transitions. [2018-10-22 15:40:28,032 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 251 transitions. Word has length 121 [2018-10-22 15:40:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:40:28,032 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 251 transitions. [2018-10-22 15:40:28,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-22 15:40:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 251 transitions. [2018-10-22 15:40:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-22 15:40:28,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:40:28,034 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:40:28,035 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:40:28,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:40:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1130647529, now seen corresponding path program 3 times [2018-10-22 15:40:28,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:40:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:40:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:28,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:40:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:40:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:40:29,018 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-22 15:40:29,697 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 29 [2018-10-22 15:40:29,836 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 30 [2018-10-22 15:40:30,020 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2018-10-22 15:40:30,299 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2018-10-22 15:40:30,449 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2018-10-22 15:40:30,589 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2018-10-22 15:40:31,168 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2018-10-22 15:40:31,345 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2018-10-22 15:40:31,646 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-10-22 15:40:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-22 15:40:31,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:40:31,932 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:40:31,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:40:45,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-22 15:40:45,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:40:45,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:40:45,373 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 6 treesize of output 5 [2018-10-22 15:40:45,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-22 15:40:45,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:45,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:45,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-22 15:40:45,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-22 15:40:45,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:40:45,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:40:45,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-22 15:40:45,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-10-22 15:40:45,746 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 24 treesize of output 23 [2018-10-22 15:40:45,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:45,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-10-22 15:40:48,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-10-22 15:40:48,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 59 [2018-10-22 15:40:48,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:48,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:48,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:48,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-10-22 15:40:51,642 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-22 15:40:55,920 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 56 [2018-10-22 15:40:56,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-10-22 15:40:56,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 10 [2018-10-22 15:40:56,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:56,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-22 15:40:56,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:56,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-22 15:40:56,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:40:56,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:40:56,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:98, output treesize:5 [2018-10-22 15:40:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-22 15:40:56,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:40:56,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2018-10-22 15:40:56,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-22 15:40:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-22 15:40:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1832, Unknown=3, NotChecked=0, Total=2070 [2018-10-22 15:40:56,319 INFO L87 Difference]: Start difference. First operand 243 states and 251 transitions. Second operand 46 states. [2018-10-22 15:40:59,594 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 71 [2018-10-22 15:41:01,670 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 62 [2018-10-22 15:41:02,843 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2018-10-22 15:41:09,864 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2018-10-22 15:41:17,951 WARN L179 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-22 15:41:25,351 WARN L179 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2018-10-22 15:41:29,692 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-10-22 15:41:31,994 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-22 15:41:34,490 WARN L179 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-10-22 15:41:36,851 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-22 15:41:37,030 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-22 15:41:43,984 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 71 [2018-10-22 15:41:46,189 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 82 [2018-10-22 15:41:48,412 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 85 [2018-10-22 15:41:52,872 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-10-22 15:41:55,669 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-10-22 15:41:56,201 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-10-22 15:41:58,818 WARN L179 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-10-22 15:41:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:41:59,193 INFO L93 Difference]: Finished difference Result 298 states and 306 transitions. [2018-10-22 15:41:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:41:59,193 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 125 [2018-10-22 15:41:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:41:59,195 INFO L225 Difference]: With dead ends: 298 [2018-10-22 15:41:59,195 INFO L226 Difference]: Without dead ends: 296 [2018-10-22 15:41:59,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 104 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=707, Invalid=5136, Unknown=9, NotChecked=0, Total=5852 [2018-10-22 15:41:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-22 15:41:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-10-22 15:41:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-22 15:41:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 277 transitions. [2018-10-22 15:41:59,224 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 277 transitions. Word has length 125 [2018-10-22 15:41:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:41:59,225 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 277 transitions. [2018-10-22 15:41:59,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-22 15:41:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 277 transitions. [2018-10-22 15:41:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-22 15:41:59,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:41:59,226 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:41:59,226 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:41:59,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:41:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609406, now seen corresponding path program 4 times [2018-10-22 15:41:59,227 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:41:59,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:41:59,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:41:59,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:41:59,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:41:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:42:00,231 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-22 15:42:01,607 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 31 [2018-10-22 15:42:01,846 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 32 [2018-10-22 15:42:01,987 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2018-10-22 15:42:02,264 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-10-22 15:42:03,102 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2018-10-22 15:42:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-22 15:42:03,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:42:03,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:42:03,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:42:03,587 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:42:03,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:42:03,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:42:03,596 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 6 treesize of output 5 [2018-10-22 15:42:03,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-22 15:42:03,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:42:03,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-22 15:42:03,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:42:03,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:42:03,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:42:03,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-22 15:42:03,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-10-22 15:42:03,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-22 15:42:03,836 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 10 treesize of output 9 [2018-10-22 15:42:03,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2018-10-22 15:42:03,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-22 15:42:03,855 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 16 treesize of output 15 [2018-10-22 15:42:03,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-22 15:42:03,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-22 15:42:03,873 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 16 treesize of output 15 [2018-10-22 15:42:03,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-22 15:42:03,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-22 15:42:03,892 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 16 treesize of output 15 [2018-10-22 15:42:03,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:03,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-10-22 15:42:04,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2018-10-22 15:42:04,004 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 24 treesize of output 23 [2018-10-22 15:42:04,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-10-22 15:42:04,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-10-22 15:42:04,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-10-22 15:42:04,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-10-22 15:42:04,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2018-10-22 15:42:04,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-22 15:42:04,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-10-22 15:42:04,474 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-10-22 15:42:04,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-22 15:42:04,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-22 15:42:04,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:42:04,532 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:59, output treesize:15 [2018-10-22 15:42:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 15:42:04,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:42:04,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 43 [2018-10-22 15:42:04,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 15:42:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 15:42:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1643, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:42:04,675 INFO L87 Difference]: Start difference. First operand 268 states and 277 transitions. Second operand 43 states. [2018-10-22 15:42:08,764 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-10-22 15:42:08,942 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-10-22 15:42:09,132 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-10-22 15:42:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:42:09,521 INFO L93 Difference]: Finished difference Result 287 states and 293 transitions. [2018-10-22 15:42:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-22 15:42:09,522 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 134 [2018-10-22 15:42:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:42:09,523 INFO L225 Difference]: With dead ends: 287 [2018-10-22 15:42:09,523 INFO L226 Difference]: Without dead ends: 188 [2018-10-22 15:42:09,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 118 SyntacticMatches, 16 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=699, Invalid=4413, Unknown=0, NotChecked=0, Total=5112 [2018-10-22 15:42:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-22 15:42:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2018-10-22 15:42:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-22 15:42:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-10-22 15:42:09,544 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 134 [2018-10-22 15:42:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:42:09,545 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-10-22 15:42:09,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 15:42:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-10-22 15:42:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-22 15:42:09,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:42:09,546 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:42:09,546 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:42:09,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:42:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash 388520720, now seen corresponding path program 5 times [2018-10-22 15:42:09,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:42:09,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:42:09,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:42:09,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:42:09,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:42:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:42:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 37 proven. 160 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-22 15:42:10,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:42:10,755 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:42:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:42:59,732 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-22 15:42:59,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:42:59,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:42:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 37 proven. 160 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-22 15:42:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:42:59,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-10-22 15:42:59,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-22 15:42:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-22 15:42:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-10-22 15:42:59,947 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 20 states. [2018-10-22 15:43:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:43:01,621 INFO L93 Difference]: Finished difference Result 458 states and 471 transitions. [2018-10-22 15:43:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 15:43:01,622 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 135 [2018-10-22 15:43:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:43:01,624 INFO L225 Difference]: With dead ends: 458 [2018-10-22 15:43:01,624 INFO L226 Difference]: Without dead ends: 357 [2018-10-22 15:43:01,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-10-22 15:43:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-22 15:43:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-10-22 15:43:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-22 15:43:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 307 transitions. [2018-10-22 15:43:01,654 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 307 transitions. Word has length 135 [2018-10-22 15:43:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:43:01,654 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 307 transitions. [2018-10-22 15:43:01,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-22 15:43:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 307 transitions. [2018-10-22 15:43:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-22 15:43:01,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:43:01,656 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:43:01,656 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:43:01,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:43:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash 665729627, now seen corresponding path program 5 times [2018-10-22 15:43:01,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:43:01,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:43:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:43:01,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:43:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:43:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:43:02,500 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-22 15:43:02,951 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 38 [2018-10-22 15:43:03,103 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-10-22 15:43:03,248 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-10-22 15:43:03,389 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-22 15:43:03,651 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-10-22 15:43:04,163 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-22 15:43:04,329 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2018-10-22 15:43:04,475 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2018-10-22 15:43:04,684 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2018-10-22 15:43:04,887 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-10-22 15:43:05,097 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2018-10-22 15:43:05,291 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 46 [2018-10-22 15:43:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-22 15:43:05,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:43:05,694 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 15:43:05,702 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:43:54,165 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 15:43:54,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:43:54,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:43:54,254 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 6 treesize of output 5 [2018-10-22 15:43:54,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-22 15:43:54,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:54,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:54,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-22 15:43:54,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-22 15:43:54,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:54,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:54,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:54,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-22 15:43:54,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-10-22 15:43:54,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-22 15:43:54,609 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 10 treesize of output 9 [2018-10-22 15:43:54,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-22 15:43:54,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-22 15:43:54,634 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 14 treesize of output 13 [2018-10-22 15:43:54,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-22 15:43:54,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-22 15:43:54,705 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 14 treesize of output 13 [2018-10-22 15:43:54,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-22 15:43:54,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-22 15:43:54,796 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 14 treesize of output 13 [2018-10-22 15:43:54,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-22 15:43:54,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-22 15:43:54,843 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 14 treesize of output 13 [2018-10-22 15:43:54,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:25 [2018-10-22 15:43:54,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-22 15:43:54,888 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 10 treesize of output 9 [2018-10-22 15:43:54,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-22 15:43:54,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-10-22 15:43:54,927 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 16 treesize of output 15 [2018-10-22 15:43:54,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:54,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-10-22 15:43:55,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-10-22 15:43:55,125 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 36 treesize of output 35 [2018-10-22 15:43:55,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2018-10-22 15:43:55,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-10-22 15:43:55,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:55,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2018-10-22 15:43:55,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:48 [2018-10-22 15:43:55,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-10-22 15:43:55,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:55,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 71 [2018-10-22 15:43:55,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:55,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:83 [2018-10-22 15:43:56,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 79 [2018-10-22 15:43:56,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:56,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:56,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:43:56,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 94 [2018-10-22 15:43:56,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:91 [2018-10-22 15:43:56,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-10-22 15:43:56,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 10 [2018-10-22 15:43:56,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-22 15:43:56,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-22 15:43:56,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:43:56,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:5 [2018-10-22 15:43:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:43:57,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:43:57,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 48 [2018-10-22 15:43:57,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-22 15:43:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-22 15:43:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2005, Unknown=0, NotChecked=0, Total=2256 [2018-10-22 15:43:57,062 INFO L87 Difference]: Start difference. First operand 297 states and 307 transitions. Second operand 48 states. [2018-10-22 15:44:01,797 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-10-22 15:44:01,981 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-10-22 15:44:03,415 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-22 15:44:03,793 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-10-22 15:44:03,962 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-10-22 15:44:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:44:05,910 INFO L93 Difference]: Finished difference Result 411 states and 420 transitions. [2018-10-22 15:44:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-22 15:44:05,910 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 137 [2018-10-22 15:44:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:44:05,912 INFO L225 Difference]: With dead ends: 411 [2018-10-22 15:44:05,912 INFO L226 Difference]: Without dead ends: 289 [2018-10-22 15:44:05,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 111 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4703 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1731, Invalid=12789, Unknown=0, NotChecked=0, Total=14520 [2018-10-22 15:44:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-22 15:44:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 201. [2018-10-22 15:44:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-22 15:44:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 208 transitions. [2018-10-22 15:44:05,933 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 208 transitions. Word has length 137 [2018-10-22 15:44:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:44:05,934 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 208 transitions. [2018-10-22 15:44:05,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-22 15:44:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 208 transitions. [2018-10-22 15:44:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-22 15:44:05,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:44:05,935 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:44:05,935 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:44:05,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:44:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1925939095, now seen corresponding path program 6 times [2018-10-22 15:44:05,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:44:05,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:44:05,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:05,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:44:05,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:44:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:44:07,594 WARN L179 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 Received shutdown request... [2018-10-22 15:44:08,366 WARN L187 SmtUtils]: Removed 7 from assertion stack [2018-10-22 15:44:08,367 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-22 15:44:08,371 WARN L205 ceAbstractionStarter]: Timeout [2018-10-22 15:44:08,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:44:08 BoogieIcfgContainer [2018-10-22 15:44:08,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:44:08,373 INFO L168 Benchmark]: Toolchain (without parser) took 267913.77 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2018-10-22 15:44:08,373 INFO L168 Benchmark]: CDTParser took 0.22 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-10-22 15:44:08,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.25 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-10-22 15:44:08,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.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-10-22 15:44:08,374 INFO L168 Benchmark]: Boogie Preprocessor took 33.39 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-10-22 15:44:08,374 INFO L168 Benchmark]: RCFGBuilder took 775.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-22 15:44:08,375 INFO L168 Benchmark]: TraceAbstraction took 266761.15 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 402.1 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -299.3 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2018-10-22 15:44:08,376 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.25 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 46.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. * Boogie Preprocessor took 33.39 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 775.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266761.15 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 402.1 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -299.3 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 150 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 76. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. TIMEOUT Result, 266.6s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 103.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 675 SDtfs, 8467 SDslu, 7581 SDs, 0 SdLazy, 13118 SolverSat, 1499 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1609 GetRequests, 878 SyntacticMatches, 90 SemanticMatches, 641 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17772 ImplicationChecksByTransitivity, 121.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 714 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 112.1s SatisfiabilityAnalysisTime, 47.0s InterpolantComputationTime, 2089 NumberOfCodeBlocks, 2089 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2067 ConstructedInterpolants, 36 QuantifiedInterpolants, 5414546 SizeOfPredicates, 192 NumberOfNonLiveVariables, 1804 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 945/2752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown