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/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 11:45:24,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 11:45:24,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 11:45:24,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 11:45:24,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 11:45:24,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 11:45:24,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 11:45:24,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 11:45:24,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 11:45:24,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 11:45:24,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 11:45:24,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 11:45:24,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 11:45:24,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 11:45:24,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 11:45:24,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 11:45:24,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 11:45:24,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 11:45:24,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 11:45:24,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 11:45:24,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 11:45:24,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 11:45:24,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 11:45:24,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 11:45:24,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 11:45:24,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 11:45:24,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 11:45:24,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 11:45:24,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 11:45:24,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 11:45:24,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 11:45:24,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 11:45:24,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 11:45:24,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 11:45:24,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 11:45:24,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 11:45:24,693 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-24 11:45:24,707 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 11:45:24,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 11:45:24,708 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 11:45:24,708 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 11:45:24,709 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 11:45:24,709 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 11:45:24,709 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 11:45:24,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 11:45:24,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 11:45:24,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 11:45:24,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 11:45:24,710 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 11:45:24,710 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 11:45:24,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 11:45:24,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 11:45:24,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 11:45:24,711 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 11:45:24,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 11:45:24,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 11:45:24,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:45:24,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 11:45:24,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 11:45:24,713 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 11:45:24,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 11:45:24,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 11:45:24,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 11:45:24,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 11:45:24,802 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 11:45:24,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 11:45:24,872 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6f0cbf5/d0bd445eed8945cc9110c9dc0f155219/FLAG92a6f73ae [2018-10-24 11:45:25,360 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 11:45:25,361 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-10-24 11:45:25,367 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6f0cbf5/d0bd445eed8945cc9110c9dc0f155219/FLAG92a6f73ae [2018-10-24 11:45:25,381 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f6f0cbf5/d0bd445eed8945cc9110c9dc0f155219 [2018-10-24 11:45:25,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 11:45:25,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 11:45:25,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:25,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 11:45:25,396 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 11:45:25,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed858fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25, skipping insertion in model container [2018-10-24 11:45:25,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 11:45:25,435 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 11:45:25,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:25,674 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 11:45:25,703 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:45:25,726 INFO L193 MainTranslator]: Completed translation [2018-10-24 11:45:25,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25 WrapperNode [2018-10-24 11:45:25,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 11:45:25,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:25,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 11:45:25,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 11:45:25,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 11:45:25,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 11:45:25,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 11:45:25,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 11:45:25,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (1/1) ... [2018-10-24 11:45:25,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 11:45:25,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 11:45:25,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 11:45:25,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 11:45:25,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (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-24 11:45:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-24 11:45:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-24 11:45:25,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 11:45:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 11:45:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-24 11:45:25,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-24 11:45:26,426 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 11:45:26,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:26 BoogieIcfgContainer [2018-10-24 11:45:26,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 11:45:26,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 11:45:26,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 11:45:26,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 11:45:26,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:25" (1/3) ... [2018-10-24 11:45:26,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:26, skipping insertion in model container [2018-10-24 11:45:26,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:25" (2/3) ... [2018-10-24 11:45:26,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:26, skipping insertion in model container [2018-10-24 11:45:26,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:26" (3/3) ... [2018-10-24 11:45:26,434 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-10-24 11:45:26,442 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 11:45:26,450 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 11:45:26,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 11:45:26,501 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 11:45:26,502 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 11:45:26,502 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 11:45:26,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 11:45:26,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 11:45:26,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 11:45:26,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 11:45:26,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 11:45:26,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 11:45:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-24 11:45:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 11:45:26,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:26,526 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] [2018-10-24 11:45:26,529 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:26,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash -794186159, now seen corresponding path program 1 times [2018-10-24 11:45:26,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:26,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:26,673 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-24 11:45:26,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:26,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 11:45:26,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 11:45:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 11:45:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 11:45:26,697 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-24 11:45:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:26,718 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-10-24 11:45:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 11:45:26,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-24 11:45:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:26,732 INFO L225 Difference]: With dead ends: 75 [2018-10-24 11:45:26,732 INFO L226 Difference]: Without dead ends: 41 [2018-10-24 11:45:26,736 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-24 11:45:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-24 11:45:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-24 11:45:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-24 11:45:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-24 11:45:26,773 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 21 [2018-10-24 11:45:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:26,774 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-24 11:45:26,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 11:45:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-24 11:45:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 11:45:26,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:26,775 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-24 11:45:26,776 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:26,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -593923913, now seen corresponding path program 1 times [2018-10-24 11:45:26,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:26,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:26,852 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-24 11:45:26,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:26,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:45:26,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:45:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:45:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:45:26,856 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 3 states. [2018-10-24 11:45:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:26,978 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-10-24 11:45:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:45:26,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 11:45:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:26,980 INFO L225 Difference]: With dead ends: 71 [2018-10-24 11:45:26,980 INFO L226 Difference]: Without dead ends: 45 [2018-10-24 11:45:26,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:45:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-24 11:45:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-24 11:45:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-24 11:45:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-24 11:45:26,988 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 23 [2018-10-24 11:45:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:26,989 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-24 11:45:26,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:45:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-24 11:45:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 11:45:26,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:26,990 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 11:45:26,990 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:26,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 496444158, now seen corresponding path program 1 times [2018-10-24 11:45:26,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:26,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:26,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:26,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:27,098 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-24 11:45:27,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:27,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:27,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:27,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-24 11:45:27,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 11:45:27,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 11:45:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 11:45:27,210 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 4 states. [2018-10-24 11:45:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:27,481 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-10-24 11:45:27,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 11:45:27,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-24 11:45:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:27,484 INFO L225 Difference]: With dead ends: 75 [2018-10-24 11:45:27,485 INFO L226 Difference]: Without dead ends: 49 [2018-10-24 11:45:27,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 11:45:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-24 11:45:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-24 11:45:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-24 11:45:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-24 11:45:27,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-10-24 11:45:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:27,498 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-24 11:45:27,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 11:45:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-24 11:45:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 11:45:27,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:27,503 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-24 11:45:27,503 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:27,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1750358469, now seen corresponding path program 2 times [2018-10-24 11:45:27,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:27,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:45:27,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:27,634 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-24 11:45:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:27,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-24 11:45:27,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:27,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 11:45:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 11:45:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-24 11:45:27,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 11:45:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 11:45:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:27,768 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2018-10-24 11:45:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:28,156 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-10-24 11:45:28,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 11:45:28,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-24 11:45:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:28,159 INFO L225 Difference]: With dead ends: 94 [2018-10-24 11:45:28,159 INFO L226 Difference]: Without dead ends: 68 [2018-10-24 11:45:28,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-24 11:45:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-24 11:45:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2018-10-24 11:45:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-24 11:45:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-24 11:45:28,174 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 31 [2018-10-24 11:45:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:28,175 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-24 11:45:28,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 11:45:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-24 11:45:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 11:45:28,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:28,177 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-10-24 11:45:28,177 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:28,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2127477742, now seen corresponding path program 1 times [2018-10-24 11:45:28,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:28,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:28,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:28,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 11:45:28,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:28,290 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-24 11:45:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:28,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 11:45:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-24 11:45:28,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 11:45:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 11:45:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 11:45:28,385 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2018-10-24 11:45:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:28,554 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-10-24 11:45:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 11:45:28,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-24 11:45:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:28,556 INFO L225 Difference]: With dead ends: 87 [2018-10-24 11:45:28,556 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 11:45:28,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-24 11:45:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 11:45:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-24 11:45:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-24 11:45:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-10-24 11:45:28,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 46 [2018-10-24 11:45:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:28,564 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-10-24 11:45:28,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 11:45:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-10-24 11:45:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 11:45:28,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:28,566 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-10-24 11:45:28,566 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:28,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1834611179, now seen corresponding path program 2 times [2018-10-24 11:45:28,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:28,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 11:45:28,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:28,894 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-24 11:45:28,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:28,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:28,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:28,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 11:45:28,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:28,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-24 11:45:28,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 11:45:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 11:45:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:28,971 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 7 states. [2018-10-24 11:45:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:29,302 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-10-24 11:45:29,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 11:45:29,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-24 11:45:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:29,304 INFO L225 Difference]: With dead ends: 125 [2018-10-24 11:45:29,308 INFO L226 Difference]: Without dead ends: 97 [2018-10-24 11:45:29,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-24 11:45:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2018-10-24 11:45:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-24 11:45:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-10-24 11:45:29,325 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 50 [2018-10-24 11:45:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:29,325 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-24 11:45:29,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 11:45:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-10-24 11:45:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-24 11:45:29,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:29,330 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2018-10-24 11:45:29,330 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:29,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1755968700, now seen corresponding path program 3 times [2018-10-24 11:45:29,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 11:45:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:29,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:29,517 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-10-24 11:45:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:29,678 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-10-24 11:45:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 11:45:29,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-10-24 11:45:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:29,680 INFO L225 Difference]: With dead ends: 105 [2018-10-24 11:45:29,681 INFO L226 Difference]: Without dead ends: 80 [2018-10-24 11:45:29,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 11:45:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-24 11:45:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-10-24 11:45:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-24 11:45:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-10-24 11:45:29,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2018-10-24 11:45:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:29,690 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-10-24 11:45:29,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-10-24 11:45:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 11:45:29,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:29,692 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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] [2018-10-24 11:45:29,692 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:29,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1400751282, now seen corresponding path program 1 times [2018-10-24 11:45:29,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 11:45:29,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:29,788 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-24 11:45:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:29,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 11:45:30,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:30,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-24 11:45:30,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 11:45:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 11:45:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-24 11:45:30,520 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 9 states. [2018-10-24 11:45:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:30,890 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-10-24 11:45:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 11:45:30,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-24 11:45:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:30,893 INFO L225 Difference]: With dead ends: 124 [2018-10-24 11:45:30,893 INFO L226 Difference]: Without dead ends: 99 [2018-10-24 11:45:30,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-10-24 11:45:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-24 11:45:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-24 11:45:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-24 11:45:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-10-24 11:45:30,904 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 60 [2018-10-24 11:45:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:30,905 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-10-24 11:45:30,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 11:45:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-10-24 11:45:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 11:45:30,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:30,907 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-10-24 11:45:30,907 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:30,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash -77800680, now seen corresponding path program 2 times [2018-10-24 11:45:30,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:30,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:30,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:30,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:30,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 11:45:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:45:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:45:31,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:45:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:45:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:45:31,003 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 5 states. [2018-10-24 11:45:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:31,131 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-10-24 11:45:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 11:45:31,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-10-24 11:45:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:31,133 INFO L225 Difference]: With dead ends: 146 [2018-10-24 11:45:31,133 INFO L226 Difference]: Without dead ends: 101 [2018-10-24 11:45:31,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 11:45:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-24 11:45:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-10-24 11:45:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-24 11:45:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-10-24 11:45:31,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 88 [2018-10-24 11:45:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:31,153 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-10-24 11:45:31,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:45:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-10-24 11:45:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-24 11:45:31,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:31,155 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 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, 1] [2018-10-24 11:45:31,155 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:31,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 916290126, now seen corresponding path program 3 times [2018-10-24 11:45:31,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:31,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:31,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 11:45:31,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:31,446 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-24 11:45:31,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:45:31,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 11:45:31,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:31,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 11:45:31,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:31,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-24 11:45:31,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 11:45:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 11:45:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-24 11:45:31,695 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 11 states. [2018-10-24 11:45:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:31,910 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-10-24 11:45:31,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 11:45:31,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-10-24 11:45:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:31,916 INFO L225 Difference]: With dead ends: 154 [2018-10-24 11:45:31,916 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 11:45:31,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-24 11:45:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 11:45:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-24 11:45:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-24 11:45:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-10-24 11:45:31,932 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 94 [2018-10-24 11:45:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:31,932 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-24 11:45:31,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 11:45:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-10-24 11:45:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 11:45:31,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:31,934 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2018-10-24 11:45:31,934 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:31,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 907761752, now seen corresponding path program 4 times [2018-10-24 11:45:31,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:31,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:31,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-24 11:45:32,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:32,602 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-24 11:45:32,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:45:32,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:45:32,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:32,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-24 11:45:32,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:32,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-24 11:45:32,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 11:45:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 11:45:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-24 11:45:32,845 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 15 states. [2018-10-24 11:45:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:33,703 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2018-10-24 11:45:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:33,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-10-24 11:45:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:33,708 INFO L225 Difference]: With dead ends: 208 [2018-10-24 11:45:33,709 INFO L226 Difference]: Without dead ends: 161 [2018-10-24 11:45:33,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 11:45:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-24 11:45:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-10-24 11:45:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-24 11:45:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-10-24 11:45:33,721 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 100 [2018-10-24 11:45:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:33,721 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-10-24 11:45:33,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 11:45:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-10-24 11:45:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-24 11:45:33,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:33,724 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 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, 1] [2018-10-24 11:45:33,724 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 712625138, now seen corresponding path program 5 times [2018-10-24 11:45:33,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:33,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 163 proven. 14 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-24 11:45:33,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:33,950 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-24 11:45:33,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:45:34,030 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-24 11:45:34,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:34,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:34,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-24 11:45:34,793 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:34,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,000 INFO L303 Elim1Store]: Index analysis took 259 ms [2018-10-24 11:45:35,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 122 [2018-10-24 11:45:35,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2018-10-24 11:45:35,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 11:45:35,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 11:45:35,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:102 [2018-10-24 11:45:35,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-10-24 11:45:35,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 97 [2018-10-24 11:45:35,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-10-24 11:45:35,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:35,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-24 11:45:35,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-24 11:45:35,657 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 13 treesize of output 12 [2018-10-24 11:45:35,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:35,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-24 11:45:35,705 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:126, output treesize:88 [2018-10-24 11:45:37,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2018-10-24 11:45:37,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 181 [2018-10-24 11:45:37,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2018-10-24 11:45:37,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-10-24 11:45:37,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,793 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:37,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-10-24 11:45:37,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:37,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 11:45:37,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:167, output treesize:28 [2018-10-24 11:45:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 192 proven. 71 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-24 11:45:38,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:38,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28] total 32 [2018-10-24 11:45:38,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 11:45:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 11:45:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-10-24 11:45:38,054 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 32 states. [2018-10-24 11:45:42,088 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2018-10-24 11:45:42,433 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-24 11:45:42,814 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-24 11:45:43,117 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-24 11:45:43,514 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2018-10-24 11:45:43,777 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-10-24 11:45:44,032 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-24 11:45:44,360 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-10-24 11:45:44,643 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-10-24 11:45:44,855 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2018-10-24 11:45:45,982 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2018-10-24 11:45:48,743 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-24 11:45:48,926 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-24 11:45:49,232 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-24 11:45:49,554 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2018-10-24 11:45:49,754 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-10-24 11:45:50,693 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-24 11:45:51,131 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-24 11:45:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:51,638 INFO L93 Difference]: Finished difference Result 601 states and 682 transitions. [2018-10-24 11:45:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-24 11:45:51,638 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 135 [2018-10-24 11:45:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:51,644 INFO L225 Difference]: With dead ends: 601 [2018-10-24 11:45:51,644 INFO L226 Difference]: Without dead ends: 536 [2018-10-24 11:45:51,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5422 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2483, Invalid=14029, Unknown=0, NotChecked=0, Total=16512 [2018-10-24 11:45:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-24 11:45:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 309. [2018-10-24 11:45:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-24 11:45:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 356 transitions. [2018-10-24 11:45:51,680 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 356 transitions. Word has length 135 [2018-10-24 11:45:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:51,680 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 356 transitions. [2018-10-24 11:45:51,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 11:45:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 356 transitions. [2018-10-24 11:45:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-24 11:45:51,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:51,683 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 8, 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, 1, 1] [2018-10-24 11:45:51,683 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:51,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 818812964, now seen corresponding path program 1 times [2018-10-24 11:45:51,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:51,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:51,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:51,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-10-24 11:45:51,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:51,883 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-24 11:45:51,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:51,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-24 11:45:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-24 11:45:52,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 11:45:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 11:45:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-24 11:45:52,186 INFO L87 Difference]: Start difference. First operand 309 states and 356 transitions. Second operand 15 states. [2018-10-24 11:45:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:52,842 INFO L93 Difference]: Finished difference Result 585 states and 688 transitions. [2018-10-24 11:45:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 11:45:52,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 152 [2018-10-24 11:45:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:52,846 INFO L225 Difference]: With dead ends: 585 [2018-10-24 11:45:52,846 INFO L226 Difference]: Without dead ends: 438 [2018-10-24 11:45:52,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2018-10-24 11:45:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-24 11:45:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 241. [2018-10-24 11:45:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-24 11:45:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2018-10-24 11:45:52,869 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 152 [2018-10-24 11:45:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:52,869 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2018-10-24 11:45:52,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 11:45:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2018-10-24 11:45:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 11:45:52,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:52,871 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 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, 1, 1] [2018-10-24 11:45:52,871 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:52,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -819722602, now seen corresponding path program 2 times [2018-10-24 11:45:52,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:52,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:45:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:45:53,722 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 12 [2018-10-24 11:45:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-10-24 11:45:53,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:45:53,961 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-24 11:45:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:45:54,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:45:54,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:45:54,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:45:54,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-24 11:45:54,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-10-24 11:45:54,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,725 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-24 11:45:54,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:26 [2018-10-24 11:45:54,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-24 11:45:54,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:54,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-24 11:45:54,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:54,790 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-24 11:45:54,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-24 11:45:55,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-24 11:45:55,031 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:45:55,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,033 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 35 treesize of output 55 [2018-10-24 11:45:55,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,062 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-24 11:45:55,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:23 [2018-10-24 11:45:55,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 11:45:55,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 45 [2018-10-24 11:45:55,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,137 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-24 11:45:55,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 11:45:55,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 11:45:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:45:55,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 11:45:55,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:45:55,343 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-24 11:45:55,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 11:45:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 119 proven. 357 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 11:45:55,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:45:55,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31] total 41 [2018-10-24 11:45:55,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 11:45:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 11:45:55,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 11:45:55,459 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand 41 states. [2018-10-24 11:45:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:45:59,826 INFO L93 Difference]: Finished difference Result 694 states and 812 transitions. [2018-10-24 11:45:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-24 11:45:59,826 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-10-24 11:45:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:45:59,831 INFO L225 Difference]: With dead ends: 694 [2018-10-24 11:45:59,831 INFO L226 Difference]: Without dead ends: 550 [2018-10-24 11:45:59,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=780, Invalid=6026, Unknown=0, NotChecked=0, Total=6806 [2018-10-24 11:45:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-24 11:45:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 359. [2018-10-24 11:45:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-24 11:45:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 408 transitions. [2018-10-24 11:45:59,868 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 408 transitions. Word has length 158 [2018-10-24 11:45:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:45:59,869 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 408 transitions. [2018-10-24 11:45:59,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 11:45:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 408 transitions. [2018-10-24 11:45:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-24 11:45:59,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:45:59,871 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-24 11:45:59,871 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:45:59,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:45:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1790866580, now seen corresponding path program 1 times [2018-10-24 11:45:59,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:45:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:45:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:59,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:45:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:45:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:00,903 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-10-24 11:46:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-10-24 11:46:01,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:01,209 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:01,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:01,280 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-24 11:46:01,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-24 11:46:01,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:01,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:01,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-10-24 11:46:01,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-24 11:46:01,466 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 15 treesize of output 12 [2018-10-24 11:46:01,468 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 12 treesize of output 11 [2018-10-24 11:46:01,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-24 11:46:01,654 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 25 treesize of output 20 [2018-10-24 11:46:01,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:01,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-10-24 11:46:01,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:01,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-24 11:46:01,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:01,838 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 12 treesize of output 11 [2018-10-24 11:46:01,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:01,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:01,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:01,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:01,897 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 12 treesize of output 11 [2018-10-24 11:46:01,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,297 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 12 treesize of output 11 [2018-10-24 11:46:02,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,333 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 12 treesize of output 11 [2018-10-24 11:46:02,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,398 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 12 treesize of output 11 [2018-10-24 11:46:02,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,532 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 12 treesize of output 11 [2018-10-24 11:46:02,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,700 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 12 treesize of output 11 [2018-10-24 11:46:02,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:02,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:02,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:02,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-24 11:46:02,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:02,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:03,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:03,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:03,203 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 12 treesize of output 11 [2018-10-24 11:46:03,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:03,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:31 [2018-10-24 11:46:03,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-10-24 11:46:03,240 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 12 treesize of output 11 [2018-10-24 11:46:03,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:03,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:46, output treesize:27 [2018-10-24 11:46:03,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-24 11:46:03,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:03,719 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:03,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:03,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-24 11:46:03,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:03,777 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-24 11:46:03,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2018-10-24 11:46:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-10-24 11:46:03,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:03,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-24 11:46:03,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 11:46:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 11:46:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-10-24 11:46:03,967 INFO L87 Difference]: Start difference. First operand 359 states and 408 transitions. Second operand 31 states. [2018-10-24 11:46:05,709 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2018-10-24 11:46:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:46:07,494 INFO L93 Difference]: Finished difference Result 398 states and 447 transitions. [2018-10-24 11:46:07,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-24 11:46:07,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2018-10-24 11:46:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:46:07,498 INFO L225 Difference]: With dead ends: 398 [2018-10-24 11:46:07,498 INFO L226 Difference]: Without dead ends: 396 [2018-10-24 11:46:07,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 11:46:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-24 11:46:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 366. [2018-10-24 11:46:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-24 11:46:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 415 transitions. [2018-10-24 11:46:07,540 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 415 transitions. Word has length 165 [2018-10-24 11:46:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:46:07,541 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 415 transitions. [2018-10-24 11:46:07,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 11:46:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 415 transitions. [2018-10-24 11:46:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 11:46:07,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:46:07,542 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:46:07,543 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:46:07,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:46:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1396560024, now seen corresponding path program 2 times [2018-10-24 11:46:07,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:46:07,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:46:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:07,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:46:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:46:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:46:08,340 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2018-10-24 11:46:09,237 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 5 [2018-10-24 11:46:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 155 proven. 202 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-10-24 11:46:09,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:46:09,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:46:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-24 11:46:10,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-24 11:46:10,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:46:10,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:46:10,057 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-24 11:46:10,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-24 11:46:10,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-24 11:46:10,103 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-24 11:46:10,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-24 11:46:10,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-24 11:46:10,152 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:10,153 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 18 treesize of output 27 [2018-10-24 11:46:10,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-24 11:46:10,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:10,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:10,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-10-24 11:46:10,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-10-24 11:46:10,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-10-24 11:46:10,274 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 12 treesize of output 11 [2018-10-24 11:46:10,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:10,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-10-24 11:46:10,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-24 11:46:10,396 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 22 treesize of output 23 [2018-10-24 11:46:10,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:10,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-24 11:46:10,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-24 11:46:10,503 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 22 treesize of output 23 [2018-10-24 11:46:10,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:10,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-24 11:46:10,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-24 11:46:10,624 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 22 treesize of output 23 [2018-10-24 11:46:10,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:10,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-10-24 11:46:10,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-24 11:46:10,708 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 22 treesize of output 23 [2018-10-24 11:46:10,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:10,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-24 11:46:10,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2018-10-24 11:46:18,800 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-24 11:46:20,854 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-24 11:46:22,911 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-24 11:46:25,017 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-24 11:46:27,187 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-24 11:46:29,298 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-10-24 11:46:31,366 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-10-24 11:46:33,454 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2018-10-24 11:46:33,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-10-24 11:46:33,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:33,515 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:33,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:46:33,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:46:33,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-10-24 11:46:33,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:33,538 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 19 treesize of output 1 [2018-10-24 11:46:33,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 11:46:33,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:46:33,551 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-24 11:46:33,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:15 [2018-10-24 11:46:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 203 proven. 47 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2018-10-24 11:46:33,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:46:33,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16] total 41 [2018-10-24 11:46:33,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 11:46:33,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 11:46:33,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1431, Unknown=3, NotChecked=0, Total=1640 [2018-10-24 11:46:33,692 INFO L87 Difference]: Start difference. First operand 366 states and 415 transitions. Second operand 41 states. [2018-10-24 11:46:58,197 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-24 11:47:02,484 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-24 11:47:06,595 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-10-24 11:47:10,795 WARN L179 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-24 11:47:15,172 WARN L179 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-24 11:47:19,377 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-10-24 11:47:23,739 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-10-24 11:47:27,961 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-24 11:47:32,317 WARN L179 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-10-24 11:47:36,618 WARN L179 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-10-24 11:47:40,982 WARN L179 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-24 11:47:45,840 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-24 11:47:50,069 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-24 11:47:54,311 WARN L179 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-10-24 11:47:58,622 WARN L179 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-10-24 11:48:05,248 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-10-24 11:48:09,482 WARN L179 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-10-24 11:48:13,888 WARN L179 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-24 11:48:18,227 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2018-10-24 11:48:44,608 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-10-24 11:48:51,647 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-24 11:48:52,089 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-10-24 11:48:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:52,417 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-10-24 11:48:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-24 11:48:52,418 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-24 11:48:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:52,420 INFO L225 Difference]: With dead ends: 743 [2018-10-24 11:48:52,421 INFO L226 Difference]: Without dead ends: 433 [2018-10-24 11:48:52,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 164 SyntacticMatches, 24 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 135.2s TimeCoverageRelationStatistics Valid=1338, Invalid=4965, Unknown=17, NotChecked=0, Total=6320 [2018-10-24 11:48:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-24 11:48:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 399. [2018-10-24 11:48:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-24 11:48:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 454 transitions. [2018-10-24 11:48:52,465 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 454 transitions. Word has length 172 [2018-10-24 11:48:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:52,466 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 454 transitions. [2018-10-24 11:48:52,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 11:48:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 454 transitions. [2018-10-24 11:48:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 11:48:52,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:52,467 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:48:52,468 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:52,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -896521002, now seen corresponding path program 3 times [2018-10-24 11:48:52,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:52,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:52,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:48:53,468 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-10-24 11:48:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 208 proven. 44 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-24 11:48:53,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:48:53,879 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:48:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 11:48:54,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 11:48:54,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:48:54,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:48:54,102 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-24 11:48:54,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-24 11:48:54,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 11:48:54,139 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 8 treesize of output 7 [2018-10-24 11:48:54,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-24 11:48:54,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-24 11:48:54,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,218 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 16 treesize of output 23 [2018-10-24 11:48:54,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-24 11:48:54,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-10-24 11:48:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,264 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,265 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 23 treesize of output 46 [2018-10-24 11:48:54,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-10-24 11:48:54,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-10-24 11:48:54,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,324 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-10-24 11:48:54,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-10-24 11:48:54,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-10-24 11:48:54,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,406 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,412 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-10-24 11:48:54,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-10-24 11:48:54,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:48:54,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-10-24 11:48:54,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-10-24 11:48:54,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-10-24 11:48: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 12 treesize of output 11 [2018-10-24 11:48:54,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:48:54,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-10-24 11:48:54,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-24 11:48:54,736 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 22 treesize of output 23 [2018-10-24 11:48:54,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 11:48:54,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-10-24 11:48:54,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2018-10-24 11:48:54,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 34 [2018-10-24 11:48:54,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:54,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-24 11:48:54,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:87 [2018-10-24 11:48:55,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-10-24 11:48:55,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 45 [2018-10-24 11:48:55,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-24 11:48:55,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:98 [2018-10-24 11:48:55,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-10-24 11:48:55,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 56 [2018-10-24 11:48:55,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-24 11:48:55,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:113, output treesize:109 [2018-10-24 11:48:55,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2018-10-24 11:48:55,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-10-24 11:48:55,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:55,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 1 [2018-10-24 11:48:55,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 11:48:56,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:56,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:48:56,007 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:112, output treesize:10 [2018-10-24 11:48:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 101 proven. 14 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-10-24 11:48:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:48:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-10-24 11:48:56,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-24 11:48:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-24 11:48:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 11:48:56,171 INFO L87 Difference]: Start difference. First operand 399 states and 454 transitions. Second operand 37 states. [2018-10-24 11:48:56,709 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-10-24 11:48:56,866 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-10-24 11:48:57,028 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-10-24 11:48:57,200 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-10-24 11:48:58,035 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-10-24 11:48:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:48:58,479 INFO L93 Difference]: Finished difference Result 773 states and 883 transitions. [2018-10-24 11:48:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 11:48:58,479 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-10-24 11:48:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:48:58,481 INFO L225 Difference]: With dead ends: 773 [2018-10-24 11:48:58,481 INFO L226 Difference]: Without dead ends: 415 [2018-10-24 11:48:58,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 11:48:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-24 11:48:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 414. [2018-10-24 11:48:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-24 11:48:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 469 transitions. [2018-10-24 11:48:58,527 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 469 transitions. Word has length 172 [2018-10-24 11:48:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:48:58,528 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 469 transitions. [2018-10-24 11:48:58,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-24 11:48:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 469 transitions. [2018-10-24 11:48:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 11:48:58,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:48:58,529 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:48:58,530 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:48:58,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:48:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 592744212, now seen corresponding path program 4 times [2018-10-24 11:48:58,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:48:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:48:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:58,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:48:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:48:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:02,064 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2018-10-24 11:49:02,222 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2018-10-24 11:49:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 164 proven. 293 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 11:49:02,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:49:02,634 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:49:02,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 11:49:02,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 11:49:02,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:49:02,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:49:03,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-24 11:49:03,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,041 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 30 treesize of output 73 [2018-10-24 11:49:03,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,060 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-24 11:49:03,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-10-24 11:49:03,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-24 11:49:03,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,078 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 30 treesize of output 73 [2018-10-24 11:49:03,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,098 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-24 11:49:03,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-10-24 11:49:03,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-10-24 11:49:03,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:03,305 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 11:49:03,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:03,310 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-24 11:49:03,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2018-10-24 11:49:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 253 proven. 99 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-24 11:49:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:49:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 19] total 54 [2018-10-24 11:49:03,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-24 11:49:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-24 11:49:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2641, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 11:49:03,398 INFO L87 Difference]: Start difference. First operand 414 states and 469 transitions. Second operand 54 states. [2018-10-24 11:49:03,769 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 25 [2018-10-24 11:49:05,902 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-10-24 11:49:06,089 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 31 [2018-10-24 11:49:06,988 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-10-24 11:49:08,422 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-24 11:49:09,556 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2018-10-24 11:49:09,750 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 34 [2018-10-24 11:49:10,117 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-10-24 11:49:10,317 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2018-10-24 11:49:11,548 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2018-10-24 11:49:14,538 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2018-10-24 11:49:14,709 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2018-10-24 11:49:14,996 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 44 [2018-10-24 11:49:15,302 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-24 11:49:15,881 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2018-10-24 11:49:16,079 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-10-24 11:49:16,356 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2018-10-24 11:49:16,554 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-10-24 11:49:16,709 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 42 [2018-10-24 11:49:19,564 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 46 [2018-10-24 11:49:21,398 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 39 [2018-10-24 11:49:22,090 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2018-10-24 11:49:22,794 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-10-24 11:49:23,024 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2018-10-24 11:49:23,197 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-10-24 11:49:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:49:23,618 INFO L93 Difference]: Finished difference Result 1190 states and 1386 transitions. [2018-10-24 11:49:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-24 11:49:23,618 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 172 [2018-10-24 11:49:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:49:23,621 INFO L225 Difference]: With dead ends: 1190 [2018-10-24 11:49:23,621 INFO L226 Difference]: Without dead ends: 868 [2018-10-24 11:49:23,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 159 SyntacticMatches, 15 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13321 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=4887, Invalid=31023, Unknown=0, NotChecked=0, Total=35910 [2018-10-24 11:49:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-10-24 11:49:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 652. [2018-10-24 11:49:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-24 11:49:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 742 transitions. [2018-10-24 11:49:23,697 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 742 transitions. Word has length 172 [2018-10-24 11:49:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:49:23,697 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 742 transitions. [2018-10-24 11:49:23,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-24 11:49:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 742 transitions. [2018-10-24 11:49:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 11:49:23,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:49:23,699 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:49:23,699 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:49:23,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:49:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1966656236, now seen corresponding path program 5 times [2018-10-24 11:49:23,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:49:23,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:49:23,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:23,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 11:49:23,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:49:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:49:24,379 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-10-24 11:49:24,908 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2018-10-24 11:49:25,136 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2018-10-24 11:49:26,495 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-24 11:49:26,696 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-24 11:49:26,865 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2018-10-24 11:49:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 219 proven. 212 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-24 11:49:27,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:49:27,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 11:49:27,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-24 11:49:27,509 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-24 11:49:27,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 11:49:27,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:49:27,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-24 11:49:27,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:28,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 79 [2018-10-24 11:49:28,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-24 11:49:28,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 11:49:28,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 11:49:28,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:73 [2018-10-24 11:49:28,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-24 11:49:28,148 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 13 treesize of output 12 [2018-10-24 11:49:28,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-10-24 11:49:28,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:28,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:28,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:28,206 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 30 treesize of output 73 [2018-10-24 11:49:28,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-24 11:49:28,257 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 13 treesize of output 12 [2018-10-24 11:49:28,257 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:28,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-24 11:49:28,289 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:100, output treesize:53 [2018-10-24 11:49:30,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2018-10-24 11:49:30,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,087 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 11:49:30,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 129 [2018-10-24 11:49:30,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:30,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:30,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:49:30,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:72 [2018-10-24 11:49:30,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-10-24 11:49:30,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,251 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 11:49:30,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2018-10-24 11:49:30,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 11:49:30,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 11:49:30,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 11:49:30,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:73 [2018-10-24 11:49:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 300 proven. 145 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 11:49:31,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:49:31,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 67 [2018-10-24 11:49:31,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-24 11:49:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-24 11:49:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4130, Unknown=0, NotChecked=0, Total=4422 [2018-10-24 11:49:31,229 INFO L87 Difference]: Start difference. First operand 652 states and 742 transitions. Second operand 67 states. [2018-10-24 11:49:31,733 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-10-24 11:49:32,100 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2018-10-24 11:49:32,445 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-10-24 11:49:32,675 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2018-10-24 11:49:32,867 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-10-24 11:49:33,254 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-10-24 11:49:33,509 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-10-24 11:49:35,226 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 46 [2018-10-24 11:49:35,668 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2018-10-24 11:49:36,106 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 45 [2018-10-24 11:49:36,697 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 49 [2018-10-24 11:49:36,938 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2018-10-24 11:49:37,223 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-10-24 11:49:37,899 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2018-10-24 11:49:38,044 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-10-24 11:49:38,488 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-10-24 11:49:39,894 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 47 [2018-10-24 11:49:40,306 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 57 [2018-10-24 11:49:40,703 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2018-10-24 11:49:44,823 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 45 [2018-10-24 11:49:45,009 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-10-24 11:49:45,326 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2018-10-24 11:49:45,528 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-10-24 11:49:45,693 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-24 11:49:46,194 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 46 [2018-10-24 11:49:46,526 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 46 [2018-10-24 11:49:46,976 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 44 [2018-10-24 11:49:47,432 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 48 [2018-10-24 11:49:47,619 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 35 [2018-10-24 11:49:47,877 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 53 [2018-10-24 11:49:48,240 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 47 [2018-10-24 11:49:48,627 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 54 [2018-10-24 11:49:49,161 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 54 [2018-10-24 11:49:49,512 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 50 [2018-10-24 11:49:49,868 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 55 Received shutdown request... [2018-10-24 11:49:50,223 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-10-24 11:49:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-24 11:49:50,223 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 11:49:50,227 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 11:49:50,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:49:50 BoogieIcfgContainer [2018-10-24 11:49:50,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 11:49:50,228 INFO L168 Benchmark]: Toolchain (without parser) took 264837.39 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 932.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -482.7 MB). Peak memory consumption was 449.5 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:50,228 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:49:50,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:50,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 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-24 11:49:50,229 INFO L168 Benchmark]: Boogie Preprocessor took 30.84 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-24 11:49:50,229 INFO L168 Benchmark]: RCFGBuilder took 623.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:50,230 INFO L168 Benchmark]: TraceAbstraction took 263799.68 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 180.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 308.4 MB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. [2018-10-24 11:49:50,232 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.27 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 30.84 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 623.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263799.68 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 180.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 308.4 MB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (652states) and FLOYD_HOARE automaton (currently 113 states, 67 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 187. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. TIMEOUT Result, 263.7s OverallTime, 19 OverallIterations, 15 TraceHistogramMax, 205.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 813 SDtfs, 7004 SDslu, 6731 SDs, 0 SdLazy, 11028 SolverSat, 2289 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 43.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 1630 SyntacticMatches, 64 SemanticMatches, 871 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34440 ImplicationChecksByTransitivity, 206.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=18, 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 999 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 54.9s InterpolantComputationTime, 3598 NumberOfCodeBlocks, 3391 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3564 ConstructedInterpolants, 258 QuantifiedInterpolants, 6118630 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2618 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 7265/9233 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown