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/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 15:40:03,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 15:40:03,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 15:40:03,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 15:40:03,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 15:40:03,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 15:40:03,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 15:40:03,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 15:40:03,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 15:40:03,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 15:40:03,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 15:40:03,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 15:40:03,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 15:40:03,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 15:40:03,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 15:40:03,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 15:40:03,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 15:40:03,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 15:40:03,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 15:40:03,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 15:40:03,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 15:40:03,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 15:40:03,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 15:40:03,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 15:40:03,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 15:40:03,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 15:40:03,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 15:40:03,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 15:40:03,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 15:40:03,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 15:40:03,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 15:40:03,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 15:40:03,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 15:40:03,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 15:40:03,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 15:40:03,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 15:40:03,649 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-23 15:40:03,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 15:40:03,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 15:40:03,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 15:40:03,665 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 15:40:03,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 15:40:03,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 15:40:03,666 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 15:40:03,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 15:40:03,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 15:40:03,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 15:40:03,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 15:40:03,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 15:40:03,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 15:40:03,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 15:40:03,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 15:40:03,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 15:40:03,668 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 15:40:03,668 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 15:40:03,668 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 15:40:03,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 15:40:03,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 15:40:03,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 15:40:03,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 15:40:03,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 15:40:03,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 15:40:03,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 15:40:03,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 15:40:03,670 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 15:40:03,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 15:40:03,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 15:40:03,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 15:40:03,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 15:40:03,730 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 15:40:03,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-23 15:40:03,789 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c13f99686/75824a2fc4fa408a995c0138f36e7954/FLAGa3d3e1c76 [2018-10-23 15:40:04,264 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 15:40:04,264 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-10-23 15:40:04,273 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c13f99686/75824a2fc4fa408a995c0138f36e7954/FLAGa3d3e1c76 [2018-10-23 15:40:04,287 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c13f99686/75824a2fc4fa408a995c0138f36e7954 [2018-10-23 15:40:04,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 15:40:04,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 15:40:04,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 15:40:04,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 15:40:04,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 15:40:04,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128929bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04, skipping insertion in model container [2018-10-23 15:40:04,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 15:40:04,348 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 15:40:04,570 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 15:40:04,574 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 15:40:04,603 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 15:40:04,624 INFO L193 MainTranslator]: Completed translation [2018-10-23 15:40:04,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04 WrapperNode [2018-10-23 15:40:04,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 15:40:04,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 15:40:04,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 15:40:04,626 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 15:40:04,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 15:40:04,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 15:40:04,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 15:40:04,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 15:40:04,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (1/1) ... [2018-10-23 15:40:04,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 15:40:04,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 15:40:04,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 15:40:04,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 15:40:04,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (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-23 15:40:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-23 15:40:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 15:40:04,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 15:40:04,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-23 15:40:04,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-23 15:40:05,254 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 15:40:05,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 03:40:05 BoogieIcfgContainer [2018-10-23 15:40:05,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 15:40:05,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 15:40:05,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 15:40:05,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 15:40:05,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 03:40:04" (1/3) ... [2018-10-23 15:40:05,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e22f605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 03:40:05, skipping insertion in model container [2018-10-23 15:40:05,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 03:40:04" (2/3) ... [2018-10-23 15:40:05,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e22f605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 03:40:05, skipping insertion in model container [2018-10-23 15:40:05,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 03:40:05" (3/3) ... [2018-10-23 15:40:05,263 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-10-23 15:40:05,271 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 15:40:05,280 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 15:40:05,297 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 15:40:05,329 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 15:40:05,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 15:40:05,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 15:40:05,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 15:40:05,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 15:40:05,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 15:40:05,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 15:40:05,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 15:40:05,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 15:40:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-23 15:40:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 15:40:05,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:05,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:05,357 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:05,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1716488208, now seen corresponding path program 1 times [2018-10-23 15:40:05,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:05,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:05,488 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-23 15:40:05,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:05,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 15:40:05,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-23 15:40:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-23 15:40:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 15:40:05,513 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-10-23 15:40:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:05,534 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-10-23 15:40:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 15:40:05,535 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-23 15:40:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:05,546 INFO L225 Difference]: With dead ends: 66 [2018-10-23 15:40:05,546 INFO L226 Difference]: Without dead ends: 28 [2018-10-23 15:40:05,550 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-23 15:40:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-23 15:40:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-23 15:40:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-23 15:40:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-23 15:40:05,587 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 11 [2018-10-23 15:40:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:05,588 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-23 15:40:05,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-23 15:40:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-23 15:40:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 15:40:05,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:05,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:05,590 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:05,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash -900053778, now seen corresponding path program 1 times [2018-10-23 15:40:05,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:05,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:05,790 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-23 15:40:05,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:05,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 15:40:05,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 15:40:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 15:40:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 15:40:05,794 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-10-23 15:40:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:06,003 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-10-23 15:40:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 15:40:06,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-23 15:40:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:06,005 INFO L225 Difference]: With dead ends: 56 [2018-10-23 15:40:06,005 INFO L226 Difference]: Without dead ends: 43 [2018-10-23 15:40:06,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-23 15:40:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-23 15:40:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-23 15:40:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-10-23 15:40:06,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2018-10-23 15:40:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:06,014 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-10-23 15:40:06,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 15:40:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-10-23 15:40:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-23 15:40:06,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:06,015 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] [2018-10-23 15:40:06,015 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:06,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash 932193404, now seen corresponding path program 1 times [2018-10-23 15:40:06,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:06,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 15:40:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 15:40:06,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 15:40:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 15:40:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 15:40:06,132 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-10-23 15:40:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:06,488 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-10-23 15:40:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 15:40:06,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-23 15:40:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:06,490 INFO L225 Difference]: With dead ends: 82 [2018-10-23 15:40:06,490 INFO L226 Difference]: Without dead ends: 56 [2018-10-23 15:40:06,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 15:40:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-23 15:40:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2018-10-23 15:40:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-23 15:40:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-23 15:40:06,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-10-23 15:40:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:06,499 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-23 15:40:06,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 15:40:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-23 15:40:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-23 15:40:06,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:06,500 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] [2018-10-23 15:40:06,500 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:06,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1844764543, now seen corresponding path program 1 times [2018-10-23 15:40:06,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:06,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:07,336 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-23 15:40:07,612 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-23 15:40:07,860 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-23 15:40:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:07,860 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-23 15:40:07,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:07,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:08,372 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-23 15:40:08,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,390 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 23 treesize of output 37 [2018-10-23 15:40:08,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,448 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-23 15:40:08,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-23 15:40:08,738 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 37 treesize of output 29 [2018-10-23 15:40:08,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:08,761 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:08,763 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:08,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-23 15:40:08,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:08,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-23 15:40:08,809 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-23 15:40:08,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:08,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-23 15:40:08,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-23 15:40:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-23 15:40:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-23 15:40:08,841 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 23 states. [2018-10-23 15:40:09,075 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 15 [2018-10-23 15:40:09,212 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-10-23 15:40:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:10,498 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-10-23 15:40:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-23 15:40:10,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-23 15:40:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:10,501 INFO L225 Difference]: With dead ends: 106 [2018-10-23 15:40:10,501 INFO L226 Difference]: Without dead ends: 104 [2018-10-23 15:40:10,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2018-10-23 15:40:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-23 15:40:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2018-10-23 15:40:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-23 15:40:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-10-23 15:40:10,516 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 24 [2018-10-23 15:40:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:10,516 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-10-23 15:40:10,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-23 15:40:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-10-23 15:40:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-23 15:40:10,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:10,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:10,518 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:10,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1668399199, now seen corresponding path program 1 times [2018-10-23 15:40:10,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:10,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:11,327 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-23 15:40:11,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:11,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:11,664 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 34 [2018-10-23 15:40:11,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:11,681 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 34 treesize of output 50 [2018-10-23 15:40:11,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:11,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:11,717 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-23 15:40:11,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-23 15:40:12,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,242 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 50 treesize of output 52 [2018-10-23 15:40:12,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,249 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:12,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-23 15:40:12,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:12,290 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-23 15:40:12,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-23 15:40:12,432 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 39 treesize of output 31 [2018-10-23 15:40:12,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:12,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,483 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:12,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:12,486 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-23 15:40:12,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:12,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:12,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:12,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-23 15:40:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:12,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:12,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-23 15:40:12,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-23 15:40:12,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-23 15:40:12,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 15:40:12,562 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 33 states. [2018-10-23 15:40:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:14,572 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-10-23 15:40:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 15:40:14,573 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 31 [2018-10-23 15:40:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:14,574 INFO L225 Difference]: With dead ends: 160 [2018-10-23 15:40:14,575 INFO L226 Difference]: Without dead ends: 110 [2018-10-23 15:40:14,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=331, Invalid=2021, Unknown=0, NotChecked=0, Total=2352 [2018-10-23 15:40:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-23 15:40:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 59. [2018-10-23 15:40:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-23 15:40:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-10-23 15:40:14,585 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 31 [2018-10-23 15:40:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:14,586 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-23 15:40:14,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-23 15:40:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-10-23 15:40:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-23 15:40:14,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:14,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:14,587 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1970442993, now seen corresponding path program 1 times [2018-10-23 15:40:14,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:14,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:14,802 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-23 15:40:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:14,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:15,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:15,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-23 15:40:15,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 15:40:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 15:40:15,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-23 15:40:15,030 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 8 states. [2018-10-23 15:40:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:15,176 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-23 15:40:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 15:40:15,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-23 15:40:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:15,178 INFO L225 Difference]: With dead ends: 89 [2018-10-23 15:40:15,178 INFO L226 Difference]: Without dead ends: 68 [2018-10-23 15:40:15,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-23 15:40:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-23 15:40:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2018-10-23 15:40:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-23 15:40:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-23 15:40:15,185 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-10-23 15:40:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:15,186 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-23 15:40:15,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 15:40:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-23 15:40:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-23 15:40:15,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:15,187 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:15,188 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:15,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1689200784, now seen corresponding path program 2 times [2018-10-23 15:40:15,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:15,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:15,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:15,789 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-23 15:40:16,269 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-10-23 15:40:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:16,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:16,660 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-23 15:40:16,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:16,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:16,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:16,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:16,951 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-23 15:40:16,956 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:16,960 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 23 treesize of output 37 [2018-10-23 15:40:16,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:16,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:16,977 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-23 15:40:16,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-23 15:40:17,089 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 32 treesize of output 25 [2018-10-23 15:40:17,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:17,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:17,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:17,100 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 25 treesize of output 58 [2018-10-23 15:40:17,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:17,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:17,125 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-23 15:40:17,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-23 15:40:17,394 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 18 [2018-10-23 15:40:17,401 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 18 treesize of output 10 [2018-10-23 15:40:17,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:17,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:17,405 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-23 15:40:17,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:40:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:17,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-23 15:40:17,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-23 15:40:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-23 15:40:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-23 15:40:17,446 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 21 states. [2018-10-23 15:40:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:18,876 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-10-23 15:40:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-23 15:40:18,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-23 15:40:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:18,882 INFO L225 Difference]: With dead ends: 156 [2018-10-23 15:40:18,883 INFO L226 Difference]: Without dead ends: 154 [2018-10-23 15:40:18,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-10-23 15:40:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-23 15:40:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 75. [2018-10-23 15:40:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-23 15:40:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-10-23 15:40:18,896 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 36 [2018-10-23 15:40:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:18,896 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-10-23 15:40:18,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-23 15:40:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-10-23 15:40:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-23 15:40:18,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:18,898 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:18,898 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:18,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1168074162, now seen corresponding path program 2 times [2018-10-23 15:40:18,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:18,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:19,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:19,900 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-23 15:40:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:19,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:19,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:19,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:20,409 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 34 [2018-10-23 15:40:20,424 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:20,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,465 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-23 15:40:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,489 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-23 15:40:20,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:52 [2018-10-23 15:40:20,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,702 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 51 treesize of output 53 [2018-10-23 15:40:20,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:20,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-23 15:40:20,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,743 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-23 15:40:20,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-23 15:40:20,872 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 34 treesize of output 27 [2018-10-23 15:40:20,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,881 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 27 treesize of output 76 [2018-10-23 15:40:20,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,907 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-23 15:40:20,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-23 15:40:20,987 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-23 15:40:20,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:20,991 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-23 15:40:20,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:20,995 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-23 15:40:20,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:40:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:21,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-23 15:40:21,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-23 15:40:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-23 15:40:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-10-23 15:40:21,050 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 31 states. [2018-10-23 15:40:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:23,009 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2018-10-23 15:40:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-23 15:40:23,009 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-10-23 15:40:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:23,011 INFO L225 Difference]: With dead ends: 204 [2018-10-23 15:40:23,011 INFO L226 Difference]: Without dead ends: 175 [2018-10-23 15:40:23,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=394, Invalid=2576, Unknown=0, NotChecked=0, Total=2970 [2018-10-23 15:40:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-23 15:40:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 94. [2018-10-23 15:40:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-23 15:40:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-10-23 15:40:23,027 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 43 [2018-10-23 15:40:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:23,027 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-10-23 15:40:23,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-23 15:40:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-10-23 15:40:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-23 15:40:23,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:23,029 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:23,030 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:23,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1672228496, now seen corresponding path program 3 times [2018-10-23 15:40:23,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:23,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:23,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:23,208 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-23 15:40:23,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:40:23,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-23 15:40:23,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:23,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:23,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:23,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-23 15:40:23,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 15:40:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 15:40:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-23 15:40:23,302 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 7 states. [2018-10-23 15:40:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:23,772 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-10-23 15:40:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 15:40:23,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-23 15:40:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:23,774 INFO L225 Difference]: With dead ends: 176 [2018-10-23 15:40:23,774 INFO L226 Difference]: Without dead ends: 146 [2018-10-23 15:40:23,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-23 15:40:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-23 15:40:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 80. [2018-10-23 15:40:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-23 15:40:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-10-23 15:40:23,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2018-10-23 15:40:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:23,801 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-10-23 15:40:23,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 15:40:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-10-23 15:40:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-23 15:40:23,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:23,804 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:23,804 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:23,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2089151200, now seen corresponding path program 2 times [2018-10-23 15:40:23,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:23,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:24,404 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 5 [2018-10-23 15:40:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:25,081 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-23 15:40:25,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:25,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:25,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:25,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:25,280 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-23 15:40:25,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:25,307 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-23 15:40:25,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:25,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:25,320 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-23 15:40:25,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-23 15:40:25,473 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 18 [2018-10-23 15:40:25,476 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 18 treesize of output 10 [2018-10-23 15:40:25,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:25,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:25,479 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-23 15:40:25,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:40:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:25,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:25,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-23 15:40:25,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-23 15:40:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-23 15:40:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-23 15:40:25,529 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 29 states. [2018-10-23 15:40:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:26,907 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-10-23 15:40:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 15:40:26,907 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-23 15:40:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:26,909 INFO L225 Difference]: With dead ends: 161 [2018-10-23 15:40:26,910 INFO L226 Difference]: Without dead ends: 159 [2018-10-23 15:40:26,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-23 15:40:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-23 15:40:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 101. [2018-10-23 15:40:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-23 15:40:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-10-23 15:40:26,925 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2018-10-23 15:40:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:26,925 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-10-23 15:40:26,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-23 15:40:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-10-23 15:40:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-23 15:40:26,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:26,926 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:26,927 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:26,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1333715085, now seen corresponding path program 1 times [2018-10-23 15:40:26,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:26,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:27,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:27,412 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-23 15:40:27,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:27,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:27,623 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-23 15:40:27,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:27,627 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 23 treesize of output 37 [2018-10-23 15:40:27,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:27,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:27,687 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-23 15:40:27,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-23 15:40:27,786 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 37 treesize of output 29 [2018-10-23 15:40:27,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:27,791 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:27,792 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:27,792 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:27,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-23 15:40:27,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:27,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:27,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:27,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-23 15:40:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:27,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:27,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-23 15:40:27,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-23 15:40:27,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-23 15:40:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-10-23 15:40:27,849 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 28 states. [2018-10-23 15:40:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:30,047 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2018-10-23 15:40:30,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-23 15:40:30,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2018-10-23 15:40:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:30,049 INFO L225 Difference]: With dead ends: 223 [2018-10-23 15:40:30,050 INFO L226 Difference]: Without dead ends: 221 [2018-10-23 15:40:30,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=647, Invalid=2545, Unknown=0, NotChecked=0, Total=3192 [2018-10-23 15:40:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-23 15:40:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 121. [2018-10-23 15:40:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-23 15:40:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-10-23 15:40:30,068 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 45 [2018-10-23 15:40:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:30,069 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-10-23 15:40:30,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-23 15:40:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-10-23 15:40:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-23 15:40:30,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:30,070 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:30,071 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 288089389, now seen corresponding path program 4 times [2018-10-23 15:40:30,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:30,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:30,507 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 15:40:30,728 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-23 15:40:30,999 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-23 15:40:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:31,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:31,539 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-23 15:40:31,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:40:31,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:40:31,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:31,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:31,723 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 34 [2018-10-23 15:40:31,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:31,728 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 34 treesize of output 50 [2018-10-23 15:40:31,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:31,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:31,852 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-23 15:40:31,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-23 15:40:32,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,061 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 50 treesize of output 52 [2018-10-23 15:40:32,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,084 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:32,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-23 15:40:32,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:32,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:32,112 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-23 15:40:32,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2018-10-23 15:40:32,272 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 39 treesize of output 31 [2018-10-23 15:40:32,274 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:32,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,276 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:32,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:32,279 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-23 15:40:32,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:32,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:32,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:32,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-23 15:40:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 15:40:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-10-23 15:40:32,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-23 15:40:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-23 15:40:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 15:40:32,361 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 33 states. [2018-10-23 15:40:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:36,692 INFO L93 Difference]: Finished difference Result 312 states and 341 transitions. [2018-10-23 15:40:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-23 15:40:36,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-10-23 15:40:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:36,696 INFO L225 Difference]: With dead ends: 312 [2018-10-23 15:40:36,696 INFO L226 Difference]: Without dead ends: 253 [2018-10-23 15:40:36,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4236 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1147, Invalid=10843, Unknown=0, NotChecked=0, Total=11990 [2018-10-23 15:40:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-23 15:40:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 121. [2018-10-23 15:40:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-23 15:40:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-10-23 15:40:36,718 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 52 [2018-10-23 15:40:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:36,718 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-10-23 15:40:36,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-23 15:40:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-10-23 15:40:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-23 15:40:36,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:36,720 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:36,720 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:36,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1256754768, now seen corresponding path program 3 times [2018-10-23 15:40:36,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:36,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:36,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:36,952 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-23 15:40:36,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:40:36,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-23 15:40:36,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:36,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:37,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:37,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-23 15:40:37,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 15:40:37,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 15:40:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-23 15:40:37,094 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 11 states. [2018-10-23 15:40:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:37,618 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2018-10-23 15:40:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 15:40:37,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-23 15:40:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:37,620 INFO L225 Difference]: With dead ends: 201 [2018-10-23 15:40:37,620 INFO L226 Difference]: Without dead ends: 172 [2018-10-23 15:40:37,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-23 15:40:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-23 15:40:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2018-10-23 15:40:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-23 15:40:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-10-23 15:40:37,637 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 52 [2018-10-23 15:40:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:37,637 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-10-23 15:40:37,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 15:40:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-10-23 15:40:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-23 15:40:37,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:37,638 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:37,638 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:37,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1448838909, now seen corresponding path program 1 times [2018-10-23 15:40:37,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:37,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:37,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:37,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:38,173 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-23 15:40:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:38,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:38,807 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-23 15:40:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:38,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:39,147 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 34 [2018-10-23 15:40:39,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,157 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 34 treesize of output 50 [2018-10-23 15:40:39,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,176 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-23 15:40:39,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-23 15:40:39,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,371 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 50 treesize of output 52 [2018-10-23 15:40:39,380 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,382 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:39,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-23 15:40:39,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,414 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-23 15:40:39,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-23 15:40:39,507 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 40 treesize of output 32 [2018-10-23 15:40:39,509 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:39,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:39,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:39,512 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-23 15:40:39,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:39,522 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-23 15:40:39,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-23 15:40:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:39,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:39,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-23 15:40:39,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-23 15:40:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-23 15:40:39,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 15:40:39,577 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 33 states. [2018-10-23 15:40:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:40,857 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-10-23 15:40:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-23 15:40:40,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-10-23 15:40:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:40,859 INFO L225 Difference]: With dead ends: 171 [2018-10-23 15:40:40,859 INFO L226 Difference]: Without dead ends: 154 [2018-10-23 15:40:40,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 15:40:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-23 15:40:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-10-23 15:40:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-23 15:40:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-23 15:40:40,875 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 53 [2018-10-23 15:40:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:40,876 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-23 15:40:40,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-23 15:40:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-23 15:40:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-23 15:40:40,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:40,877 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:40,877 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:40,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1298017201, now seen corresponding path program 4 times [2018-10-23 15:40:40,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:40,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:40,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:41,450 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-23 15:40:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:42,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:42,108 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-23 15:40:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:40:42,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:40:42,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:42,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:42,252 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 15 treesize of output 12 [2018-10-23 15:40:42,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-23 15:40:42,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,262 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-23 15:40:42,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-23 15:40:42,462 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-23 15:40:42,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:42,465 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 23 treesize of output 37 [2018-10-23 15:40:42,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,482 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-23 15:40:42,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-23 15:40:42,577 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 32 treesize of output 25 [2018-10-23 15:40:42,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:42,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:42,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:42,588 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 25 treesize of output 58 [2018-10-23 15:40:42,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,607 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-23 15:40:42,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-23 15:40:42,789 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 18 [2018-10-23 15:40:42,791 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 18 treesize of output 10 [2018-10-23 15:40:42,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:42,796 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-23 15:40:42,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:40:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:42,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:42,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-23 15:40:42,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-23 15:40:42,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-23 15:40:42,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-23 15:40:42,850 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 36 states. [2018-10-23 15:40:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:44,250 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-10-23 15:40:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-23 15:40:44,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-23 15:40:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:44,252 INFO L225 Difference]: With dead ends: 191 [2018-10-23 15:40:44,252 INFO L226 Difference]: Without dead ends: 189 [2018-10-23 15:40:44,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-23 15:40:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-23 15:40:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-10-23 15:40:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-23 15:40:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2018-10-23 15:40:44,271 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 56 [2018-10-23 15:40:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:44,271 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2018-10-23 15:40:44,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-23 15:40:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2018-10-23 15:40:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-23 15:40:44,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:44,272 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:44,272 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:44,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -927524220, now seen corresponding path program 2 times [2018-10-23 15:40:44,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:44,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:44,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:44,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:44,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:44,898 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-23 15:40:44,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:40:44,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:40:44,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:44,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:45,197 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 29 treesize of output 24 [2018-10-23 15:40:45,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:45,201 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 24 treesize of output 39 [2018-10-23 15:40:45,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,220 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-23 15:40:45,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-23 15:40:45,312 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 32 treesize of output 25 [2018-10-23 15:40:45,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:45,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:45,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:45,324 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 25 treesize of output 58 [2018-10-23 15:40:45,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,343 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-23 15:40:45,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-23 15:40:45,391 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 18 [2018-10-23 15:40:45,398 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 18 treesize of output 10 [2018-10-23 15:40:45,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:45,400 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-23 15:40:45,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:40:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:45,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:45,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-23 15:40:45,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-23 15:40:45,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-23 15:40:45,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-10-23 15:40:45,447 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand 29 states. [2018-10-23 15:40:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:47,323 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-10-23 15:40:47,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-23 15:40:47,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-10-23 15:40:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:47,324 INFO L225 Difference]: With dead ends: 246 [2018-10-23 15:40:47,325 INFO L226 Difference]: Without dead ends: 244 [2018-10-23 15:40:47,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2018-10-23 15:40:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-23 15:40:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 166. [2018-10-23 15:40:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-23 15:40:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-10-23 15:40:47,349 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 57 [2018-10-23 15:40:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:47,349 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-10-23 15:40:47,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-23 15:40:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-10-23 15:40:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-23 15:40:47,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:47,350 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:47,351 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:47,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 589290242, now seen corresponding path program 3 times [2018-10-23 15:40:47,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:47,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:47,570 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-23 15:40:47,746 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-23 15:40:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:48,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:48,990 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-23 15:40:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:40:49,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-23 15:40:49,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:40:49,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:49,252 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-23 15:40:49,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,257 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 23 treesize of output 37 [2018-10-23 15:40:49,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,276 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-23 15:40:49,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-23 15:40:49,403 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 20 [2018-10-23 15:40:49,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,409 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,413 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 20 treesize of output 43 [2018-10-23 15:40:49,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,498 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-23 15:40:49,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-10-23 15:40:49,561 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-23 15:40:49,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,571 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 52 [2018-10-23 15:40:49,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,594 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-23 15:40:49,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-23 15:40:49,677 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-23 15:40:49,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:49,687 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 52 [2018-10-23 15:40:49,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,707 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-23 15:40:49,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2018-10-23 15:40:49,769 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 18 [2018-10-23 15:40:49,772 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 18 treesize of output 10 [2018-10-23 15:40:49,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:49,775 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-23 15:40:49,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:40:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:49,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 35 [2018-10-23 15:40:49,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-23 15:40:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-23 15:40:49,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2018-10-23 15:40:49,822 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 35 states. [2018-10-23 15:40:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:40:52,135 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2018-10-23 15:40:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-23 15:40:52,135 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-10-23 15:40:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:40:52,136 INFO L225 Difference]: With dead ends: 404 [2018-10-23 15:40:52,137 INFO L226 Difference]: Without dead ends: 402 [2018-10-23 15:40:52,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=684, Invalid=4866, Unknown=0, NotChecked=0, Total=5550 [2018-10-23 15:40:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-23 15:40:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 194. [2018-10-23 15:40:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-23 15:40:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 211 transitions. [2018-10-23 15:40:52,162 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 211 transitions. Word has length 57 [2018-10-23 15:40:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:40:52,162 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 211 transitions. [2018-10-23 15:40:52,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-23 15:40:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 211 transitions. [2018-10-23 15:40:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-23 15:40:52,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:40:52,163 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:40:52,163 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:40:52,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:40:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash 594732221, now seen corresponding path program 1 times [2018-10-23 15:40:52,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:40:52,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:40:52,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:52,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:40:52,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:40:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:52,714 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-23 15:40:53,181 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2018-10-23 15:40:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:54,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:40:54,833 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-23 15:40:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:40:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:40:54,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:40:55,190 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-23 15:40:55,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:55,240 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 23 treesize of output 37 [2018-10-23 15:40:55,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:55,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:55,489 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-23 15:40:55,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-23 15:40:56,214 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 39 [2018-10-23 15:40:56,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:56,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:56,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:56,220 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:56,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 97 [2018-10-23 15:40:56,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:56,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:56,256 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-23 15:40:56,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-23 15:40:57,296 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-23 15:40:57,334 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 66 treesize of output 53 [2018-10-23 15:40:57,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:57,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:57,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:57,436 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:57,473 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:57,634 INFO L303 Elim1Store]: Index analysis took 299 ms [2018-10-23 15:40:57,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 115 [2018-10-23 15:40:57,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:57,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:57,810 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-23 15:40:57,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-23 15:40:58,003 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 54 treesize of output 43 [2018-10-23 15:40:58,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-10-23 15:40:58,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:40:58,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:40:58,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-23 15:40:58,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-23 15:40:58,464 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 37 treesize of output 29 [2018-10-23 15:40:58,469 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:40:58,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:40:58,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-23 15:40:58,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:40:58,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:58,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:40:58,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-23 15:40:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:40:58,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:40:58,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-10-23 15:40:58,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-23 15:40:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-23 15:40:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2665, Unknown=0, NotChecked=0, Total=2970 [2018-10-23 15:40:58,559 INFO L87 Difference]: Start difference. First operand 194 states and 211 transitions. Second operand 55 states. [2018-10-23 15:41:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:02,983 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-10-23 15:41:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-23 15:41:02,983 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 60 [2018-10-23 15:41:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:02,985 INFO L225 Difference]: With dead ends: 260 [2018-10-23 15:41:02,985 INFO L226 Difference]: Without dead ends: 243 [2018-10-23 15:41:02,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=807, Invalid=6503, Unknown=0, NotChecked=0, Total=7310 [2018-10-23 15:41:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-23 15:41:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 214. [2018-10-23 15:41:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-23 15:41:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 232 transitions. [2018-10-23 15:41:03,016 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 232 transitions. Word has length 60 [2018-10-23 15:41:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:03,016 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 232 transitions. [2018-10-23 15:41:03,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-23 15:41:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2018-10-23 15:41:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-23 15:41:03,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:03,018 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:03,018 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:03,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -211122400, now seen corresponding path program 5 times [2018-10-23 15:41:03,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:03,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:41:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:03,558 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-23 15:41:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:04,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:04,582 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:04,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:41:04,621 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-23 15:41:04,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:04,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:04,900 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 34 [2018-10-23 15:41:04,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:04,904 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 34 treesize of output 50 [2018-10-23 15:41:04,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:04,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:04,929 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-23 15:41:04,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:41:05,157 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,158 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 51 treesize of output 53 [2018-10-23 15:41:05,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-23 15:41:05,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,187 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-23 15:41:05,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-23 15:41:05,295 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 34 treesize of output 27 [2018-10-23 15:41:05,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,306 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,310 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 27 treesize of output 77 [2018-10-23 15:41:05,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,331 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-23 15:41:05,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-10-23 15:41:05,354 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 34 treesize of output 27 [2018-10-23 15:41:05,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,362 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 27 treesize of output 76 [2018-10-23 15:41:05,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,382 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-23 15:41:05,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-23 15:41:05,422 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 34 treesize of output 27 [2018-10-23 15:41:05,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,430 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 27 treesize of output 76 [2018-10-23 15:41:05,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,451 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-23 15:41:05,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-23 15:41:05,801 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-23 15:41:05,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:05,806 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-23 15:41:05,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:05,809 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-23 15:41:05,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:41:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:05,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:05,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 37 [2018-10-23 15:41:05,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-23 15:41:05,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-23 15:41:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2018-10-23 15:41:05,869 INFO L87 Difference]: Start difference. First operand 214 states and 232 transitions. Second operand 37 states. [2018-10-23 15:41:07,790 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-23 15:41:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:09,697 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-10-23 15:41:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-23 15:41:09,698 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-23 15:41:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:09,699 INFO L225 Difference]: With dead ends: 333 [2018-10-23 15:41:09,699 INFO L226 Difference]: Without dead ends: 331 [2018-10-23 15:41:09,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=772, Invalid=5390, Unknown=0, NotChecked=0, Total=6162 [2018-10-23 15:41:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-23 15:41:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 198. [2018-10-23 15:41:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-23 15:41:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-10-23 15:41:09,732 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 64 [2018-10-23 15:41:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:09,732 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-10-23 15:41:09,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-23 15:41:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-10-23 15:41:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-23 15:41:09,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:09,734 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:09,734 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:09,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1718281922, now seen corresponding path program 6 times [2018-10-23 15:41:09,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:09,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:09,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:09,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:09,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:10,215 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2018-10-23 15:41:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:10,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:10,907 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:10,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:41:10,947 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-23 15:41:10,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:10,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:11,169 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 34 [2018-10-23 15:41:11,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,183 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 34 treesize of output 50 [2018-10-23 15:41:11,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,205 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-23 15:41:11,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-23 15:41:11,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,388 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 50 treesize of output 52 [2018-10-23 15:41:11,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:11,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-23 15:41:11,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,421 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-23 15:41:11,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:32 [2018-10-23 15:41:11,591 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 32 [2018-10-23 15:41:11,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,601 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 96 [2018-10-23 15:41:11,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,625 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-23 15:41:11,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-23 15:41:11,741 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 39 treesize of output 31 [2018-10-23 15:41:11,743 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:11,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:11,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:11,747 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-23 15:41:11,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:11,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-23 15:41:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-23 15:41:11,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:11,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2018-10-23 15:41:11,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-23 15:41:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-23 15:41:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1442, Unknown=0, NotChecked=0, Total=1640 [2018-10-23 15:41:11,816 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 41 states. [2018-10-23 15:41:17,664 WARN L179 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-23 15:41:19,666 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-23 15:41:20,582 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-23 15:41:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:20,992 INFO L93 Difference]: Finished difference Result 419 states and 451 transitions. [2018-10-23 15:41:20,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-23 15:41:20,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2018-10-23 15:41:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:20,994 INFO L225 Difference]: With dead ends: 419 [2018-10-23 15:41:20,994 INFO L226 Difference]: Without dead ends: 369 [2018-10-23 15:41:20,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6979 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1969, Invalid=18053, Unknown=0, NotChecked=0, Total=20022 [2018-10-23 15:41:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-23 15:41:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 227. [2018-10-23 15:41:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-23 15:41:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2018-10-23 15:41:21,031 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 64 [2018-10-23 15:41:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:21,031 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2018-10-23 15:41:21,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-23 15:41:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2018-10-23 15:41:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-23 15:41:21,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:21,032 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:21,033 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:21,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash 927491905, now seen corresponding path program 5 times [2018-10-23 15:41:21,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:21,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:21,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:21,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:21,673 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:41:21,727 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-23 15:41:21,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:21,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:21,907 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 15 treesize of output 12 [2018-10-23 15:41:21,908 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-23 15:41:21,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:21,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:21,918 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-23 15:41:21,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-23 15:41:22,096 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-23 15:41:22,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:22,103 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 23 treesize of output 37 [2018-10-23 15:41:22,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:22,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:22,120 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-23 15:41:22,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-23 15:41:22,443 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 32 treesize of output 24 [2018-10-23 15:41:22,447 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:22,448 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:22,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:22,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-10-23 15:41:22,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:22,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:22,466 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-23 15:41:22,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-23 15:41:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-23 15:41:22,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-23 15:41:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-23 15:41:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-23 15:41:22,532 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand 37 states. [2018-10-23 15:41:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:24,717 INFO L93 Difference]: Finished difference Result 407 states and 439 transitions. [2018-10-23 15:41:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-23 15:41:24,717 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-23 15:41:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:24,718 INFO L225 Difference]: With dead ends: 407 [2018-10-23 15:41:24,719 INFO L226 Difference]: Without dead ends: 405 [2018-10-23 15:41:24,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-23 15:41:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-23 15:41:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 287. [2018-10-23 15:41:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-23 15:41:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-23 15:41:24,771 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 64 [2018-10-23 15:41:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:24,771 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-23 15:41:24,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-23 15:41:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-23 15:41:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-23 15:41:24,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:24,773 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:24,773 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:24,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1371876588, now seen corresponding path program 2 times [2018-10-23 15:41:24,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:24,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:25,962 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:25,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:41:25,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:41:25,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:25,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:26,257 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 34 [2018-10-23 15:41:26,260 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,262 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 34 treesize of output 50 [2018-10-23 15:41:26,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,283 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-23 15:41:26,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:41:26,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,503 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 51 treesize of output 53 [2018-10-23 15:41:26,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:26,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-23 15:41:26,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,556 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-23 15:41:26,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-23 15:41:26,676 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 24 [2018-10-23 15:41:26,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,684 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 24 treesize of output 67 [2018-10-23 15:41:26,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,701 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-23 15:41:26,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-23 15:41:26,917 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-23 15:41:26,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:26,961 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-23 15:41:26,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:26,993 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-23 15:41:26,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:41:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:27,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:27,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-10-23 15:41:27,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-23 15:41:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-23 15:41:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2018-10-23 15:41:27,087 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 45 states. [2018-10-23 15:41:27,477 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-23 15:41:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:28,600 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2018-10-23 15:41:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-23 15:41:28,603 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2018-10-23 15:41:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:28,604 INFO L225 Difference]: With dead ends: 360 [2018-10-23 15:41:28,604 INFO L226 Difference]: Without dead ends: 358 [2018-10-23 15:41:28,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=463, Invalid=3443, Unknown=0, NotChecked=0, Total=3906 [2018-10-23 15:41:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-23 15:41:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2018-10-23 15:41:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-23 15:41:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2018-10-23 15:41:28,653 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 65 [2018-10-23 15:41:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:28,653 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2018-10-23 15:41:28,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-23 15:41:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2018-10-23 15:41:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-23 15:41:28,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:28,654 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:28,654 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:28,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1838298514, now seen corresponding path program 3 times [2018-10-23 15:41:28,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:28,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:29,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:29,587 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:29,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:41:29,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-23 15:41:29,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:29,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:29,980 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-23 15:41:29,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:29,984 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-23 15:41:29,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:29,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:29,997 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-23 15:41:29,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-23 15:41:30,114 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 18 [2018-10-23 15:41:30,116 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 18 treesize of output 10 [2018-10-23 15:41:30,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:30,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:30,119 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-23 15:41:30,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:41:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:30,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-10-23 15:41:30,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-23 15:41:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-23 15:41:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-10-23 15:41:30,174 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 30 states. [2018-10-23 15:41:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:31,882 INFO L93 Difference]: Finished difference Result 486 states and 522 transitions. [2018-10-23 15:41:31,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-23 15:41:31,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-10-23 15:41:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:31,884 INFO L225 Difference]: With dead ends: 486 [2018-10-23 15:41:31,884 INFO L226 Difference]: Without dead ends: 484 [2018-10-23 15:41:31,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=525, Invalid=3635, Unknown=0, NotChecked=0, Total=4160 [2018-10-23 15:41:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-23 15:41:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 313. [2018-10-23 15:41:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-23 15:41:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 344 transitions. [2018-10-23 15:41:31,940 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 344 transitions. Word has length 65 [2018-10-23 15:41:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:31,940 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 344 transitions. [2018-10-23 15:41:31,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-23 15:41:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 344 transitions. [2018-10-23 15:41:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-23 15:41:31,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:31,942 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:31,942 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:31,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash 158141761, now seen corresponding path program 4 times [2018-10-23 15:41:31,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:31,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:32,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:32,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:41:32,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:41:32,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:32,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:32,674 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-23 15:41:32,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:32,678 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 23 treesize of output 37 [2018-10-23 15:41:32,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:32,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:32,695 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-23 15:41:32,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-23 15:41:32,760 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 18 [2018-10-23 15:41:32,762 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 18 treesize of output 10 [2018-10-23 15:41:32,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:32,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:32,772 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-23 15:41:32,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:41:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:32,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 21 [2018-10-23 15:41:32,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-23 15:41:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-23 15:41:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-10-23 15:41:32,818 INFO L87 Difference]: Start difference. First operand 313 states and 344 transitions. Second operand 21 states. [2018-10-23 15:41:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:35,506 INFO L93 Difference]: Finished difference Result 636 states and 687 transitions. [2018-10-23 15:41:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-23 15:41:35,506 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-23 15:41:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:35,508 INFO L225 Difference]: With dead ends: 636 [2018-10-23 15:41:35,508 INFO L226 Difference]: Without dead ends: 578 [2018-10-23 15:41:35,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=667, Invalid=5653, Unknown=0, NotChecked=0, Total=6320 [2018-10-23 15:41:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-23 15:41:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 332. [2018-10-23 15:41:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-23 15:41:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 366 transitions. [2018-10-23 15:41:35,571 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 366 transitions. Word has length 66 [2018-10-23 15:41:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:35,571 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 366 transitions. [2018-10-23 15:41:35,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-23 15:41:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 366 transitions. [2018-10-23 15:41:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-23 15:41:35,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:35,572 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:35,572 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:35,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1160141791, now seen corresponding path program 2 times [2018-10-23 15:41:35,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:35,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:35,977 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 15:41:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:37,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:37,963 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:41:38,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:41:38,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:38,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:38,225 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 34 [2018-10-23 15:41:38,228 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:38,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,233 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-23 15:41:38,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,259 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-23 15:41:38,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-23 15:41:38,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,500 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 51 treesize of output 53 [2018-10-23 15:41:38,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-23 15:41:38,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,533 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-23 15:41:38,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-23 15:41:38,657 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 36 [2018-10-23 15:41:38,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:38,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:38,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 106 [2018-10-23 15:41:38,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:38,704 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-23 15:41:38,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-23 15:41:39,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,033 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 65 treesize of output 63 [2018-10-23 15:41:39,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,045 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:39,046 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:39,050 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 186 [2018-10-23 15:41:39,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:41:39,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:39,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 15:41:39,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-23 15:41:39,377 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 58 treesize of output 47 [2018-10-23 15:41:39,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,387 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-10-23 15:41:39,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:41:39,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:41:39,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-23 15:41:39,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-23 15:41:39,731 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-23 15:41:39,734 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:39,734 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-23 15:41:39,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:39,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:39,738 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-23 15:41:39,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:41:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:39,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:39,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 55 [2018-10-23 15:41:39,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-23 15:41:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-23 15:41:39,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2667, Unknown=0, NotChecked=0, Total=2970 [2018-10-23 15:41:39,870 INFO L87 Difference]: Start difference. First operand 332 states and 366 transitions. Second operand 55 states. [2018-10-23 15:41:42,617 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2018-10-23 15:41:44,049 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-23 15:41:44,711 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-23 15:41:44,913 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-10-23 15:41:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:45,031 INFO L93 Difference]: Finished difference Result 434 states and 472 transitions. [2018-10-23 15:41:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-23 15:41:45,031 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2018-10-23 15:41:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:45,033 INFO L225 Difference]: With dead ends: 434 [2018-10-23 15:41:45,033 INFO L226 Difference]: Without dead ends: 417 [2018-10-23 15:41:45,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=960, Invalid=8160, Unknown=0, NotChecked=0, Total=9120 [2018-10-23 15:41:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-23 15:41:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 285. [2018-10-23 15:41:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-23 15:41:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 316 transitions. [2018-10-23 15:41:45,085 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 316 transitions. Word has length 67 [2018-10-23 15:41:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:45,085 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 316 transitions. [2018-10-23 15:41:45,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-23 15:41:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 316 transitions. [2018-10-23 15:41:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-23 15:41:45,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:45,086 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:45,087 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:45,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -235702322, now seen corresponding path program 3 times [2018-10-23 15:41:45,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:45,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:45,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:45,320 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-23 15:41:45,595 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-23 15:41:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:47,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:47,633 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:47,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:41:47,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-23 15:41:47,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:47,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:47,759 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-23 15:41:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:47,764 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 23 treesize of output 37 [2018-10-23 15:41:47,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:47,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:47,782 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-23 15:41:47,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-23 15:41:47,896 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 43 treesize of output 34 [2018-10-23 15:41:47,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:47,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:47,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:47,901 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:47,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 80 [2018-10-23 15:41:47,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:47,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:47,936 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-23 15:41:47,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:46 [2018-10-23 15:41:48,159 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 64 treesize of output 51 [2018-10-23 15:41:48,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,176 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 136 [2018-10-23 15:41:48,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-23 15:41:48,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-23 15:41:48,364 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-23 15:41:48,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:192 [2018-10-23 15:41:48,537 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-10-23 15:41:48,935 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 53 treesize of output 42 [2018-10-23 15:41:48,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:48,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:48,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-10-23 15:41:48,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:48,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:48,981 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-23 15:41:48,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-10-23 15:41:49,197 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 36 [2018-10-23 15:41:49,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:49,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:49,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:49,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 70 [2018-10-23 15:41:49,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:49,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:49,227 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-23 15:41:49,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:29 [2018-10-23 15:41:49,454 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 18 [2018-10-23 15:41:49,456 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 18 treesize of output 10 [2018-10-23 15:41:49,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:49,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:49,459 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-23 15:41:49,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:41:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 50 [2018-10-23 15:41:49,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-23 15:41:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-23 15:41:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2250, Unknown=0, NotChecked=0, Total=2450 [2018-10-23 15:41:49,557 INFO L87 Difference]: Start difference. First operand 285 states and 316 transitions. Second operand 50 states. [2018-10-23 15:41:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:54,082 INFO L93 Difference]: Finished difference Result 453 states and 493 transitions. [2018-10-23 15:41:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-23 15:41:54,083 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-10-23 15:41:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:54,084 INFO L225 Difference]: With dead ends: 453 [2018-10-23 15:41:54,084 INFO L226 Difference]: Without dead ends: 451 [2018-10-23 15:41:54,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 47 SyntacticMatches, 19 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=674, Invalid=7158, Unknown=0, NotChecked=0, Total=7832 [2018-10-23 15:41:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-23 15:41:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 341. [2018-10-23 15:41:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-23 15:41:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 378 transitions. [2018-10-23 15:41:54,131 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 378 transitions. Word has length 72 [2018-10-23 15:41:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:54,132 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 378 transitions. [2018-10-23 15:41:54,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-23 15:41:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 378 transitions. [2018-10-23 15:41:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-23 15:41:54,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:54,133 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:54,133 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:54,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1018817839, now seen corresponding path program 6 times [2018-10-23 15:41:54,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:54,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:54,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:54,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:54,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:54,747 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:54,756 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:41:54,792 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-23 15:41:54,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:54,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:54,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-23 15:41:54,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 15:41:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 15:41:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-23 15:41:54,898 INFO L87 Difference]: Start difference. First operand 341 states and 378 transitions. Second operand 14 states. [2018-10-23 15:41:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:55,376 INFO L93 Difference]: Finished difference Result 510 states and 558 transitions. [2018-10-23 15:41:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 15:41:55,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-23 15:41:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:55,378 INFO L225 Difference]: With dead ends: 510 [2018-10-23 15:41:55,378 INFO L226 Difference]: Without dead ends: 473 [2018-10-23 15:41:55,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-23 15:41:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-23 15:41:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 361. [2018-10-23 15:41:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-23 15:41:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 396 transitions. [2018-10-23 15:41:55,434 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 396 transitions. Word has length 72 [2018-10-23 15:41:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:55,434 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 396 transitions. [2018-10-23 15:41:55,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-23 15:41:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 396 transitions. [2018-10-23 15:41:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-23 15:41:55,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:55,435 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:55,435 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:55,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1685520350, now seen corresponding path program 4 times [2018-10-23 15:41:55,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:55,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:56,138 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-23 15:41:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:56,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:56,649 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:56,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:41:56,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:41:56,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:56,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:56,905 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 34 [2018-10-23 15:41:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:56,909 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 34 treesize of output 50 [2018-10-23 15:41:56,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:56,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:56,928 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-23 15:41:56,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-23 15:41:56,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:56,994 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 40 treesize of output 39 [2018-10-23 15:41:56,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:56,998 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:56,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-10-23 15:41:56,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:57,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:57,011 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-23 15:41:57,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:17 [2018-10-23 15:41:57,128 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 40 treesize of output 32 [2018-10-23 15:41:57,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:57,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:57,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:57,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:41:57,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:57,133 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-23 15:41:57,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:57,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:57,140 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-23 15:41:57,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-23 15:41:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:41:57,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2018-10-23 15:41:57,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-23 15:41:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-23 15:41:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-10-23 15:41:57,201 INFO L87 Difference]: Start difference. First operand 361 states and 396 transitions. Second operand 34 states. [2018-10-23 15:41:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:41:58,513 INFO L93 Difference]: Finished difference Result 427 states and 462 transitions. [2018-10-23 15:41:58,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-23 15:41:58,513 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-10-23 15:41:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:41:58,516 INFO L225 Difference]: With dead ends: 427 [2018-10-23 15:41:58,516 INFO L226 Difference]: Without dead ends: 402 [2018-10-23 15:41:58,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2018-10-23 15:41:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-23 15:41:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 348. [2018-10-23 15:41:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-23 15:41:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 381 transitions. [2018-10-23 15:41:58,572 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 381 transitions. Word has length 73 [2018-10-23 15:41:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:41:58,572 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 381 transitions. [2018-10-23 15:41:58,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-23 15:41:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 381 transitions. [2018-10-23 15:41:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-23 15:41:58,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:41:58,573 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:41:58,574 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:41:58,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:41:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1855670063, now seen corresponding path program 5 times [2018-10-23 15:41:58,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:41:58,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:41:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:58,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:41:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:41:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:41:58,908 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-23 15:41:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:41:59,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:41:59,433 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:41:59,441 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:41:59,481 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-23 15:41:59,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:41:59,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:41:59,762 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 34 [2018-10-23 15:41:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:59,765 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 34 treesize of output 50 [2018-10-23 15:41:59,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:59,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:41:59,787 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-23 15:41:59,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-23 15:41:59,972 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:59,973 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 52 treesize of output 54 [2018-10-23 15:41:59,976 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:59,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:41:59,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-23 15:41:59,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:41:59,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:00,000 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-23 15:42:00,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-10-23 15:42:00,304 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 36 treesize of output 28 [2018-10-23 15:42:00,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:00,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:00,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:00,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:00,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:00,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-23 15:42:00,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:00,359 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-23 15:42:00,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-10-23 15:42:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 19 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:00,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-10-23 15:42:00,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-23 15:42:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-23 15:42:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-10-23 15:42:00,473 INFO L87 Difference]: Start difference. First operand 348 states and 381 transitions. Second operand 39 states. [2018-10-23 15:42:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:05,135 INFO L93 Difference]: Finished difference Result 447 states and 480 transitions. [2018-10-23 15:42:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-23 15:42:05,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-10-23 15:42:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:05,137 INFO L225 Difference]: With dead ends: 447 [2018-10-23 15:42:05,137 INFO L226 Difference]: Without dead ends: 445 [2018-10-23 15:42:05,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3243 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=979, Invalid=9941, Unknown=0, NotChecked=0, Total=10920 [2018-10-23 15:42:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-23 15:42:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 357. [2018-10-23 15:42:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-23 15:42:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 390 transitions. [2018-10-23 15:42:05,192 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 390 transitions. Word has length 74 [2018-10-23 15:42:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:05,192 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 390 transitions. [2018-10-23 15:42:05,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-23 15:42:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 390 transitions. [2018-10-23 15:42:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-23 15:42:05,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:05,194 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:05,194 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:05,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1860733778, now seen corresponding path program 7 times [2018-10-23 15:42:05,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:05,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:05,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:05,994 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:06,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:42:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:06,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:06,061 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 15 treesize of output 12 [2018-10-23 15:42:06,063 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-23 15:42:06,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,073 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-23 15:42:06,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-23 15:42:06,156 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 22 [2018-10-23 15:42:06,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,160 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 22 treesize of output 35 [2018-10-23 15:42:06,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,177 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-23 15:42:06,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-23 15:42:06,237 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 36 treesize of output 29 [2018-10-23 15:42:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,248 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 29 treesize of output 70 [2018-10-23 15:42:06,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,268 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-23 15:42:06,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-23 15:42:06,371 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 38 treesize of output 30 [2018-10-23 15:42:06,373 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:06,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:06,375 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:06,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2018-10-23 15:42:06,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:06,387 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-23 15:42:06,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-23 15:42:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:06,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:06,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-23 15:42:06,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-23 15:42:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-23 15:42:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-23 15:42:06,455 INFO L87 Difference]: Start difference. First operand 357 states and 390 transitions. Second operand 27 states. [2018-10-23 15:42:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:08,123 INFO L93 Difference]: Finished difference Result 488 states and 526 transitions. [2018-10-23 15:42:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-23 15:42:08,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-23 15:42:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:08,125 INFO L225 Difference]: With dead ends: 488 [2018-10-23 15:42:08,125 INFO L226 Difference]: Without dead ends: 486 [2018-10-23 15:42:08,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-23 15:42:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-23 15:42:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 408. [2018-10-23 15:42:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-23 15:42:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 446 transitions. [2018-10-23 15:42:08,204 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 446 transitions. Word has length 76 [2018-10-23 15:42:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:08,204 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 446 transitions. [2018-10-23 15:42:08,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-23 15:42:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 446 transitions. [2018-10-23 15:42:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-23 15:42:08,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:08,205 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:08,206 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1758305189, now seen corresponding path program 6 times [2018-10-23 15:42:08,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:42:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:09,373 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:09,383 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:42:09,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-23 15:42:09,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:09,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:09,722 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 34 [2018-10-23 15:42:09,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:09,726 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 34 treesize of output 50 [2018-10-23 15:42:09,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:09,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:09,749 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-23 15:42:09,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:42:09,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:09,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-23 15:42:09,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:09,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-23 15:42:09,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:09,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:09,876 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-23 15:42:09,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-23 15:42:10,001 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 33 treesize of output 26 [2018-10-23 15:42:10,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,010 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 26 treesize of output 73 [2018-10-23 15:42:10,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,028 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-23 15:42:10,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2018-10-23 15:42:10,119 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 34 treesize of output 27 [2018-10-23 15:42:10,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,127 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 27 treesize of output 76 [2018-10-23 15:42:10,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,148 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-23 15:42:10,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-23 15:42:10,365 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-23 15:42:10,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:10,367 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-23 15:42:10,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:10,371 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-23 15:42:10,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:42:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:10,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:10,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 48 [2018-10-23 15:42:10,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-23 15:42:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-23 15:42:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2018-10-23 15:42:10,487 INFO L87 Difference]: Start difference. First operand 408 states and 446 transitions. Second operand 48 states. [2018-10-23 15:42:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:12,731 INFO L93 Difference]: Finished difference Result 567 states and 614 transitions. [2018-10-23 15:42:12,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-23 15:42:12,731 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 77 [2018-10-23 15:42:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:12,733 INFO L225 Difference]: With dead ends: 567 [2018-10-23 15:42:12,733 INFO L226 Difference]: Without dead ends: 565 [2018-10-23 15:42:12,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=603, Invalid=4947, Unknown=0, NotChecked=0, Total=5550 [2018-10-23 15:42:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-23 15:42:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 430. [2018-10-23 15:42:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-23 15:42:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 471 transitions. [2018-10-23 15:42:12,812 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 471 transitions. Word has length 77 [2018-10-23 15:42:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:12,812 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 471 transitions. [2018-10-23 15:42:12,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-23 15:42:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 471 transitions. [2018-10-23 15:42:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-23 15:42:12,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:12,813 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:12,814 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:12,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1788817699, now seen corresponding path program 7 times [2018-10-23 15:42:12,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:12,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:12,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:13,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:13,450 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:13,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:42:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:13,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:13,655 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 29 treesize of output 24 [2018-10-23 15:42:13,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,660 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 24 treesize of output 39 [2018-10-23 15:42:13,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,674 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-23 15:42:13,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-23 15:42:13,753 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 36 treesize of output 29 [2018-10-23 15:42:13,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,757 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,762 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 29 treesize of output 70 [2018-10-23 15:42:13,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,778 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-23 15:42:13,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-23 15:42:13,887 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 36 treesize of output 28 [2018-10-23 15:42:13,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,890 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:13,890 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:13,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-23 15:42:13,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:13,900 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-23 15:42:13,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-23 15:42:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-23 15:42:13,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-23 15:42:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-23 15:42:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-10-23 15:42:13,963 INFO L87 Difference]: Start difference. First operand 430 states and 471 transitions. Second operand 30 states. [2018-10-23 15:42:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:15,746 INFO L93 Difference]: Finished difference Result 613 states and 664 transitions. [2018-10-23 15:42:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-23 15:42:15,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-10-23 15:42:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:15,749 INFO L225 Difference]: With dead ends: 613 [2018-10-23 15:42:15,749 INFO L226 Difference]: Without dead ends: 611 [2018-10-23 15:42:15,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=2273, Unknown=0, NotChecked=0, Total=2652 [2018-10-23 15:42:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-23 15:42:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 451. [2018-10-23 15:42:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-23 15:42:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 495 transitions. [2018-10-23 15:42:15,833 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 495 transitions. Word has length 77 [2018-10-23 15:42:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:15,834 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 495 transitions. [2018-10-23 15:42:15,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-23 15:42:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 495 transitions. [2018-10-23 15:42:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-23 15:42:15,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:15,835 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:15,835 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:15,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 704025505, now seen corresponding path program 8 times [2018-10-23 15:42:15,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:42:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:16,424 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 5 [2018-10-23 15:42:16,785 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 9 [2018-10-23 15:42:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:17,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:17,432 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:42:17,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:42:17,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:17,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:17,693 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-23 15:42:17,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,697 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 23 treesize of output 37 [2018-10-23 15:42:17,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,711 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-23 15:42:17,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-23 15:42:17,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-10-23 15:42:17,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,842 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 24 treesize of output 55 [2018-10-23 15:42:17,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,860 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-23 15:42:17,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-10-23 15:42:17,925 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 32 treesize of output 25 [2018-10-23 15:42:17,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,934 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 25 treesize of output 58 [2018-10-23 15:42:17,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:17,952 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-23 15:42:17,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-10-23 15:42:17,991 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 29 treesize of output 22 [2018-10-23 15:42:17,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:17,999 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 22 treesize of output 49 [2018-10-23 15:42:17,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:18,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:18,014 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-23 15:42:18,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-10-23 15:42:18,204 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 18 [2018-10-23 15:42:18,206 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 18 treesize of output 10 [2018-10-23 15:42:18,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:18,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:18,210 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-23 15:42:18,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:42:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:18,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:18,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-10-23 15:42:18,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-23 15:42:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-23 15:42:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2018-10-23 15:42:18,281 INFO L87 Difference]: Start difference. First operand 451 states and 495 transitions. Second operand 41 states. [2018-10-23 15:42:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:19,995 INFO L93 Difference]: Finished difference Result 609 states and 662 transitions. [2018-10-23 15:42:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-23 15:42:19,996 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2018-10-23 15:42:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:19,998 INFO L225 Difference]: With dead ends: 609 [2018-10-23 15:42:19,998 INFO L226 Difference]: Without dead ends: 607 [2018-10-23 15:42:19,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=414, Invalid=3618, Unknown=0, NotChecked=0, Total=4032 [2018-10-23 15:42:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-23 15:42:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 472. [2018-10-23 15:42:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-23 15:42:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2018-10-23 15:42:20,084 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 77 [2018-10-23 15:42:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:20,084 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2018-10-23 15:42:20,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-23 15:42:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2018-10-23 15:42:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-23 15:42:20,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:20,086 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:20,086 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:20,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1402389330, now seen corresponding path program 5 times [2018-10-23 15:42:20,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:20,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:20,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:21,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:21,562 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:21,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:42:21,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-23 15:42:21,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:21,921 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 29 treesize of output 24 [2018-10-23 15:42:21,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:21,925 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 24 treesize of output 39 [2018-10-23 15:42:21,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:21,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:21,940 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-23 15:42:21,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-23 15:42:22,032 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 32 treesize of output 25 [2018-10-23 15:42:22,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:22,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:22,038 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:22,043 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 25 treesize of output 58 [2018-10-23 15:42:22,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:22,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:22,062 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-23 15:42:22,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-23 15:42:22,126 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 18 [2018-10-23 15:42:22,129 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 18 treesize of output 10 [2018-10-23 15:42:22,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:22,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:22,131 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-23 15:42:22,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:42:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:22,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:22,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 36 [2018-10-23 15:42:22,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-23 15:42:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-23 15:42:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2018-10-23 15:42:22,193 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand 36 states. [2018-10-23 15:42:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:24,234 INFO L93 Difference]: Finished difference Result 626 states and 680 transitions. [2018-10-23 15:42:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-23 15:42:24,234 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 78 [2018-10-23 15:42:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:24,237 INFO L225 Difference]: With dead ends: 626 [2018-10-23 15:42:24,237 INFO L226 Difference]: Without dead ends: 624 [2018-10-23 15:42:24,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 64 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=420, Invalid=3002, Unknown=0, NotChecked=0, Total=3422 [2018-10-23 15:42:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-23 15:42:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 479. [2018-10-23 15:42:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-23 15:42:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 528 transitions. [2018-10-23 15:42:24,320 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 528 transitions. Word has length 78 [2018-10-23 15:42:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:24,320 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 528 transitions. [2018-10-23 15:42:24,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-23 15:42:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 528 transitions. [2018-10-23 15:42:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-23 15:42:24,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:24,321 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:24,322 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:24,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash -644583150, now seen corresponding path program 6 times [2018-10-23 15:42:24,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:24,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 20 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:25,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:25,357 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:25,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:42:25,419 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-23 15:42:25,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:25,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:25,491 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-23 15:42:25,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,496 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 23 treesize of output 37 [2018-10-23 15:42:25,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,512 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-23 15:42:25,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-23 15:42:25,587 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 32 treesize of output 25 [2018-10-23 15:42:25,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,591 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,598 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 25 treesize of output 58 [2018-10-23 15:42:25,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,620 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-23 15:42:25,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-23 15:42:25,697 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 32 treesize of output 25 [2018-10-23 15:42:25,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,708 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 25 treesize of output 58 [2018-10-23 15:42:25,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,730 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-23 15:42:25,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-10-23 15:42:25,799 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 33 treesize of output 26 [2018-10-23 15:42:25,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,809 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 26 treesize of output 61 [2018-10-23 15:42:25,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:25,840 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-23 15:42:25,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-23 15:42:25,932 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 33 treesize of output 26 [2018-10-23 15:42:25,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:25,996 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 26 treesize of output 61 [2018-10-23 15:42:25,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,016 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-23 15:42:26,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-10-23 15:42:26,180 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 33 treesize of output 26 [2018-10-23 15:42:26,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:26,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:26,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:26,194 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 26 treesize of output 61 [2018-10-23 15:42:26,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,231 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-23 15:42:26,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:33 [2018-10-23 15:42:26,338 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 18 [2018-10-23 15:42:26,340 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 18 treesize of output 10 [2018-10-23 15:42:26,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:26,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-23 15:42:26,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:42:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:26,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:26,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 32 [2018-10-23 15:42:26,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-23 15:42:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-23 15:42:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-10-23 15:42:26,413 INFO L87 Difference]: Start difference. First operand 479 states and 528 transitions. Second operand 32 states. [2018-10-23 15:42:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:30,207 INFO L93 Difference]: Finished difference Result 994 states and 1086 transitions. [2018-10-23 15:42:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-23 15:42:30,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 78 [2018-10-23 15:42:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:30,210 INFO L225 Difference]: With dead ends: 994 [2018-10-23 15:42:30,210 INFO L226 Difference]: Without dead ends: 936 [2018-10-23 15:42:30,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 62 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1043, Invalid=5763, Unknown=0, NotChecked=0, Total=6806 [2018-10-23 15:42:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-10-23 15:42:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 592. [2018-10-23 15:42:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-23 15:42:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 655 transitions. [2018-10-23 15:42:30,309 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 655 transitions. Word has length 78 [2018-10-23 15:42:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:30,309 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 655 transitions. [2018-10-23 15:42:30,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-23 15:42:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 655 transitions. [2018-10-23 15:42:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-23 15:42:30,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:30,311 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:30,311 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:30,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1265415184, now seen corresponding path program 4 times [2018-10-23 15:42:30,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:30,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:30,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:30,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:30,712 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 15:42:30,907 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-23 15:42:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:33,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:33,210 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:33,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:42:33,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:42:33,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:33,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:33,567 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 34 [2018-10-23 15:42:33,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:33,571 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 34 treesize of output 50 [2018-10-23 15:42:33,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:33,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:33,593 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-23 15:42:33,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-23 15:42:33,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:33,861 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 51 treesize of output 53 [2018-10-23 15:42:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:33,909 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:33,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:33,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-23 15:42:33,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:33,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:33,956 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-23 15:42:33,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:29 [2018-10-23 15:42:34,177 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 51 treesize of output 42 [2018-10-23 15:42:34,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,182 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:34,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 137 [2018-10-23 15:42:34,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:34,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:34,228 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-23 15:42:34,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:56 [2018-10-23 15:42:34,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,558 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 72 treesize of output 70 [2018-10-23 15:42:34,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 140 [2018-10-23 15:42:34,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:42:34,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:34,621 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-23 15:42:34,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:50 [2018-10-23 15:42:34,826 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 60 treesize of output 49 [2018-10-23 15:42:34,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:34,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 164 [2018-10-23 15:42:34,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:42:34,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:42:34,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:42:34,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:83 [2018-10-23 15:42:35,141 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 32 [2018-10-23 15:42:35,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,150 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 96 [2018-10-23 15:42:35,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:35,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:35,170 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-23 15:42:35,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2018-10-23 15:42:35,700 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 41 treesize of output 33 [2018-10-23 15:42:35,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:35,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:35,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:35,707 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 53 [2018-10-23 15:42:35,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:35,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:35,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:35,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-10-23 15:42:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 13 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:35,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 70 [2018-10-23 15:42:35,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-23 15:42:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-23 15:42:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4550, Unknown=0, NotChecked=0, Total=4830 [2018-10-23 15:42:35,877 INFO L87 Difference]: Start difference. First operand 592 states and 655 transitions. Second operand 70 states. [2018-10-23 15:42:39,791 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-23 15:42:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:43,823 INFO L93 Difference]: Finished difference Result 712 states and 780 transitions. [2018-10-23 15:42:43,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-23 15:42:43,823 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 79 [2018-10-23 15:42:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:43,826 INFO L225 Difference]: With dead ends: 712 [2018-10-23 15:42:43,826 INFO L226 Difference]: Without dead ends: 695 [2018-10-23 15:42:43,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5953 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1113, Invalid=16443, Unknown=0, NotChecked=0, Total=17556 [2018-10-23 15:42:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-23 15:42:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2018-10-23 15:42:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-23 15:42:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 653 transitions. [2018-10-23 15:42:43,935 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 653 transitions. Word has length 79 [2018-10-23 15:42:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:43,936 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 653 transitions. [2018-10-23 15:42:43,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-23 15:42:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 653 transitions. [2018-10-23 15:42:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-23 15:42:43,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:43,937 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:43,938 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 82829615, now seen corresponding path program 5 times [2018-10-23 15:42:43,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:43,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:44,492 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-23 15:42:44,871 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-10-23 15:42:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:46,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:46,251 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:42:46,306 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-23 15:42:46,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:46,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:46,576 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-23 15:42:46,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,582 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 23 treesize of output 37 [2018-10-23 15:42:46,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,605 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-23 15:42:46,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-23 15:42:46,698 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 34 treesize of output 27 [2018-10-23 15:42:46,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 64 [2018-10-23 15:42:46,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,738 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-23 15:42:46,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-10-23 15:42:46,816 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-23 15:42:46,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,827 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 52 [2018-10-23 15:42:46,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,846 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-23 15:42:46,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2018-10-23 15:42:46,927 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 32 [2018-10-23 15:42:46,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:46,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 84 [2018-10-23 15:42:46,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:46,974 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-23 15:42:46,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-23 15:42:47,188 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 62 treesize of output 49 [2018-10-23 15:42:47,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 153 [2018-10-23 15:42:47,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-23 15:42:47,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:42:47,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-23 15:42:47,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:105 [2018-10-23 15:42:47,760 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 38 treesize of output 27 [2018-10-23 15:42:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:47,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-10-23 15:42:47,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:47,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:47,791 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-23 15:42:47,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:19 [2018-10-23 15:42:48,003 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 18 [2018-10-23 15:42:48,005 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 18 treesize of output 10 [2018-10-23 15:42:48,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:48,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:48,007 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-23 15:42:48,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:42:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:48,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:48,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 50 [2018-10-23 15:42:48,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-23 15:42:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-23 15:42:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2018-10-23 15:42:48,101 INFO L87 Difference]: Start difference. First operand 591 states and 653 transitions. Second operand 50 states. [2018-10-23 15:42:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:42:53,995 INFO L93 Difference]: Finished difference Result 1007 states and 1095 transitions. [2018-10-23 15:42:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-23 15:42:53,995 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 81 [2018-10-23 15:42:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:42:53,999 INFO L225 Difference]: With dead ends: 1007 [2018-10-23 15:42:53,999 INFO L226 Difference]: Without dead ends: 893 [2018-10-23 15:42:54,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 54 SyntacticMatches, 21 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=850, Invalid=12260, Unknown=0, NotChecked=0, Total=13110 [2018-10-23 15:42:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-23 15:42:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 652. [2018-10-23 15:42:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-23 15:42:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 722 transitions. [2018-10-23 15:42:54,127 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 722 transitions. Word has length 81 [2018-10-23 15:42:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:42:54,127 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 722 transitions. [2018-10-23 15:42:54,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-23 15:42:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 722 transitions. [2018-10-23 15:42:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-23 15:42:54,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:42:54,129 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-23 15:42:54,129 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:42:54,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:42:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1325388897, now seen corresponding path program 9 times [2018-10-23 15:42:54,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:42:54,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:42:54,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:54,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:42:54,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:42:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:42:54,454 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-23 15:42:54,668 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2018-10-23 15:42:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:42:55,739 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:42:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-23 15:42:55,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-23 15:42:55,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:42:55,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:42:56,046 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-23 15:42:56,048 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,050 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 23 treesize of output 37 [2018-10-23 15:42:56,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,066 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-23 15:42:56,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-23 15:42:56,250 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 39 [2018-10-23 15:42:56,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,260 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 39 treesize of output 84 [2018-10-23 15:42:56,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,281 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-23 15:42:56,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-23 15:42:56,446 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 69 treesize of output 56 [2018-10-23 15:42:56,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 87 [2018-10-23 15:42:56,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,486 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-23 15:42:56,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2018-10-23 15:42:56,808 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 59 treesize of output 48 [2018-10-23 15:42:56,816 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:56,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 79 [2018-10-23 15:42:56,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:56,860 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-23 15:42:56,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:31 [2018-10-23 15:42:57,363 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-23 15:42:57,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:57,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:42:57,369 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:42:57,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-10-23 15:42:57,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:42:57,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:42:57,387 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-23 15:42:57,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:3 [2018-10-23 15:42:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:42:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:42:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 53 [2018-10-23 15:42:57,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-23 15:42:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-23 15:42:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2594, Unknown=0, NotChecked=0, Total=2756 [2018-10-23 15:42:57,486 INFO L87 Difference]: Start difference. First operand 652 states and 722 transitions. Second operand 53 states. [2018-10-23 15:43:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:02,697 INFO L93 Difference]: Finished difference Result 742 states and 817 transitions. [2018-10-23 15:43:02,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-23 15:43:02,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 82 [2018-10-23 15:43:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:02,700 INFO L225 Difference]: With dead ends: 742 [2018-10-23 15:43:02,700 INFO L226 Difference]: Without dead ends: 717 [2018-10-23 15:43:02,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=650, Invalid=8856, Unknown=0, NotChecked=0, Total=9506 [2018-10-23 15:43:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-23 15:43:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 674. [2018-10-23 15:43:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-23 15:43:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 746 transitions. [2018-10-23 15:43:02,810 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 746 transitions. Word has length 82 [2018-10-23 15:43:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:02,810 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 746 transitions. [2018-10-23 15:43:02,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-23 15:43:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 746 transitions. [2018-10-23 15:43:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-23 15:43:02,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:02,811 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:02,811 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:02,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -754084382, now seen corresponding path program 8 times [2018-10-23 15:43:02,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:02,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:02,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:03,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:03,425 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:03,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:43:03,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:43:03,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:03,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:03,747 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 15 treesize of output 12 [2018-10-23 15:43:03,749 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-23 15:43:03,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:03,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:03,756 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-23 15:43:03,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-23 15:43:03,911 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-23 15:43:03,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:03,916 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-23 15:43:03,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:03,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:03,930 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-23 15:43:03,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-23 15:43:04,191 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 18 [2018-10-23 15:43:04,194 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 18 treesize of output 10 [2018-10-23 15:43:04,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:04,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:04,217 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-23 15:43:04,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:43:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:04,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-10-23 15:43:04,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-23 15:43:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-23 15:43:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-10-23 15:43:04,300 INFO L87 Difference]: Start difference. First operand 674 states and 746 transitions. Second operand 38 states. [2018-10-23 15:43:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:06,505 INFO L93 Difference]: Finished difference Result 1134 states and 1246 transitions. [2018-10-23 15:43:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-23 15:43:06,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-10-23 15:43:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:06,509 INFO L225 Difference]: With dead ends: 1134 [2018-10-23 15:43:06,509 INFO L226 Difference]: Without dead ends: 1132 [2018-10-23 15:43:06,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2018-10-23 15:43:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-23 15:43:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 845. [2018-10-23 15:43:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-10-23 15:43:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 940 transitions. [2018-10-23 15:43:06,661 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 940 transitions. Word has length 84 [2018-10-23 15:43:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:06,661 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 940 transitions. [2018-10-23 15:43:06,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-23 15:43:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 940 transitions. [2018-10-23 15:43:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-23 15:43:06,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:06,662 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:06,662 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:06,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1734794316, now seen corresponding path program 7 times [2018-10-23 15:43:06,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:06,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:07,203 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-23 15:43:07,541 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-10-23 15:43:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:08,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:08,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:09,727 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 34 [2018-10-23 15:43:09,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:09,763 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 34 treesize of output 50 [2018-10-23 15:43:09,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:09,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:09,786 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-23 15:43:09,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:43:10,039 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,042 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 50 treesize of output 52 [2018-10-23 15:43:10,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,047 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:10,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-23 15:43:10,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,078 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-23 15:43:10,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-23 15:43:10,222 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 38 treesize of output 31 [2018-10-23 15:43:10,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,232 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 31 treesize of output 93 [2018-10-23 15:43:10,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,257 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-23 15:43:10,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-23 15:43:10,356 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 38 treesize of output 31 [2018-10-23 15:43:10,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,366 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 31 treesize of output 93 [2018-10-23 15:43:10,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,390 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-23 15:43:10,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-10-23 15:43:10,491 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 32 [2018-10-23 15:43:10,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,514 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,515 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,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 96 [2018-10-23 15:43:10,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,541 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-23 15:43:10,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-23 15:43:10,601 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 32 [2018-10-23 15:43:10,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,611 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 96 [2018-10-23 15:43:10,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,636 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-23 15:43:10,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-23 15:43:10,693 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 36 treesize of output 29 [2018-10-23 15:43:10,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,703 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 29 treesize of output 87 [2018-10-23 15:43:10,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,726 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-23 15:43:10,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-23 15:43:10,885 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 39 treesize of output 31 [2018-10-23 15:43:10,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,889 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:10,889 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:10,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:10,891 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-10-23 15:43:10,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:10,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-23 15:43:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 49 [2018-10-23 15:43:10,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-23 15:43:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-23 15:43:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2140, Unknown=0, NotChecked=0, Total=2352 [2018-10-23 15:43:10,995 INFO L87 Difference]: Start difference. First operand 845 states and 940 transitions. Second operand 49 states. [2018-10-23 15:43:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:15,406 INFO L93 Difference]: Finished difference Result 1120 states and 1236 transitions. [2018-10-23 15:43:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-23 15:43:15,406 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 85 [2018-10-23 15:43:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:15,409 INFO L225 Difference]: With dead ends: 1120 [2018-10-23 15:43:15,409 INFO L226 Difference]: Without dead ends: 1062 [2018-10-23 15:43:15,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=667, Invalid=7523, Unknown=0, NotChecked=0, Total=8190 [2018-10-23 15:43:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-23 15:43:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 879. [2018-10-23 15:43:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-10-23 15:43:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 978 transitions. [2018-10-23 15:43:15,577 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 978 transitions. Word has length 85 [2018-10-23 15:43:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:15,578 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 978 transitions. [2018-10-23 15:43:15,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-23 15:43:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 978 transitions. [2018-10-23 15:43:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-23 15:43:15,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:15,579 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:15,579 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:15,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash -533865805, now seen corresponding path program 10 times [2018-10-23 15:43:15,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:15,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:15,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:16,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:16,410 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:16,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 15:43:16,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 15:43:16,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:16,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:16,843 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 34 [2018-10-23 15:43:16,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:16,846 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 34 treesize of output 50 [2018-10-23 15:43:16,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:16,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:16,869 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-23 15:43:16,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:43:16,978 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:16,979 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 51 treesize of output 53 [2018-10-23 15:43:16,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:16,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:16,986 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-23 15:43:16,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:17,005 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-23 15:43:17,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2018-10-23 15:43:17,222 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 24 [2018-10-23 15:43:17,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:17,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:17,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:17,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:17,238 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 24 treesize of output 67 [2018-10-23 15:43:17,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:17,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:17,265 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-23 15:43:17,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-23 15:43:17,567 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-23 15:43:17,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:17,569 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-23 15:43:17,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:17,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:17,574 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-23 15:43:17,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:43:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:17,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:17,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-23 15:43:17,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-23 15:43:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-23 15:43:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2018-10-23 15:43:17,655 INFO L87 Difference]: Start difference. First operand 879 states and 978 transitions. Second operand 45 states. [2018-10-23 15:43:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:19,522 INFO L93 Difference]: Finished difference Result 1004 states and 1109 transitions. [2018-10-23 15:43:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-23 15:43:19,522 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2018-10-23 15:43:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:19,526 INFO L225 Difference]: With dead ends: 1004 [2018-10-23 15:43:19,526 INFO L226 Difference]: Without dead ends: 1002 [2018-10-23 15:43:19,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=3884, Unknown=0, NotChecked=0, Total=4290 [2018-10-23 15:43:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-10-23 15:43:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 870. [2018-10-23 15:43:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-10-23 15:43:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 969 transitions. [2018-10-23 15:43:19,699 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 969 transitions. Word has length 85 [2018-10-23 15:43:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:19,700 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 969 transitions. [2018-10-23 15:43:19,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-23 15:43:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 969 transitions. [2018-10-23 15:43:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-23 15:43:19,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:19,701 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:19,701 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:19,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2068717775, now seen corresponding path program 11 times [2018-10-23 15:43:19,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:19,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:19,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:20,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:20,596 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-23 15:43:20,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-23 15:43:20,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:20,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:20,786 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 15 treesize of output 12 [2018-10-23 15:43:20,804 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-23 15:43:20,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,822 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-23 15:43:20,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-23 15:43:20,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-23 15:43:20,870 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-23 15:43:20,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,879 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-23 15:43:20,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-23 15:43:20,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-23 15:43:20,925 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-23 15:43:20,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:20,934 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-23 15:43:20,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-10-23 15:43:21,061 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-23 15:43:21,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:21,065 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-23 15:43:21,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:21,078 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-23 15:43:21,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-23 15:43:21,289 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 18 [2018-10-23 15:43:21,291 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 18 treesize of output 10 [2018-10-23 15:43:21,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:21,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:21,294 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-23 15:43:21,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:43:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:21,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:21,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-23 15:43:21,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-23 15:43:21,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-23 15:43:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-10-23 15:43:21,360 INFO L87 Difference]: Start difference. First operand 870 states and 969 transitions. Second operand 37 states. [2018-10-23 15:43:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:24,483 INFO L93 Difference]: Finished difference Result 1311 states and 1438 transitions. [2018-10-23 15:43:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-23 15:43:24,483 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 85 [2018-10-23 15:43:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:24,487 INFO L225 Difference]: With dead ends: 1311 [2018-10-23 15:43:24,487 INFO L226 Difference]: Without dead ends: 1309 [2018-10-23 15:43:24,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=787, Invalid=7045, Unknown=0, NotChecked=0, Total=7832 [2018-10-23 15:43:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-10-23 15:43:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 949. [2018-10-23 15:43:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2018-10-23 15:43:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1060 transitions. [2018-10-23 15:43:24,672 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1060 transitions. Word has length 85 [2018-10-23 15:43:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:24,672 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 1060 transitions. [2018-10-23 15:43:24,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-23 15:43:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1060 transitions. [2018-10-23 15:43:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-23 15:43:24,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:24,673 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:24,674 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:24,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 570674658, now seen corresponding path program 12 times [2018-10-23 15:43:24,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:24,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:24,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:25,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:25,609 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:25,616 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:43:25,682 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-23 15:43:25,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:25,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:26,005 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 34 [2018-10-23 15:43:26,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,010 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 34 treesize of output 50 [2018-10-23 15:43:26,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,034 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-23 15:43:26,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-23 15:43:26,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-23 15:43:26,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,139 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-23 15:43:26,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,156 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-23 15:43:26,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-10-23 15:43:26,272 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 34 treesize of output 27 [2018-10-23 15:43:26,276 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,283 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 27 treesize of output 76 [2018-10-23 15:43:26,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,304 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-23 15:43:26,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-23 15:43:26,523 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-23 15:43:26,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:26,526 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-23 15:43:26,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:26,529 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-23 15:43:26,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:43:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-10-23 15:43:26,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-23 15:43:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-23 15:43:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 15:43:26,635 INFO L87 Difference]: Start difference. First operand 949 states and 1060 transitions. Second operand 44 states. [2018-10-23 15:43:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:29,637 INFO L93 Difference]: Finished difference Result 1163 states and 1283 transitions. [2018-10-23 15:43:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-23 15:43:29,637 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-10-23 15:43:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:29,640 INFO L225 Difference]: With dead ends: 1163 [2018-10-23 15:43:29,640 INFO L226 Difference]: Without dead ends: 1161 [2018-10-23 15:43:29,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=634, Invalid=4916, Unknown=0, NotChecked=0, Total=5550 [2018-10-23 15:43:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2018-10-23 15:43:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 945. [2018-10-23 15:43:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-10-23 15:43:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1054 transitions. [2018-10-23 15:43:29,822 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1054 transitions. Word has length 86 [2018-10-23 15:43:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:29,823 INFO L481 AbstractCegarLoop]: Abstraction has 945 states and 1054 transitions. [2018-10-23 15:43:29,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-23 15:43:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1054 transitions. [2018-10-23 15:43:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-23 15:43:29,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:29,824 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:29,824 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:29,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash -849888350, now seen corresponding path program 13 times [2018-10-23 15:43:29,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:29,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:29,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:30,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:30,281 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:30,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:30,434 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-23 15:43:30,477 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:30,499 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-23 15:43:30,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:30,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:30,520 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-23 15:43:30,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-23 15:43:30,630 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 36 treesize of output 28 [2018-10-23 15:43:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:30,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:30,633 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:30,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-23 15:43:30,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:30,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:30,642 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-23 15:43:30,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-23 15:43:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:30,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:30,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-10-23 15:43:30,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-23 15:43:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-23 15:43:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-23 15:43:30,697 INFO L87 Difference]: Start difference. First operand 945 states and 1054 transitions. Second operand 24 states. [2018-10-23 15:43:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:34,257 INFO L93 Difference]: Finished difference Result 1403 states and 1537 transitions. [2018-10-23 15:43:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-23 15:43:34,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-10-23 15:43:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:34,263 INFO L225 Difference]: With dead ends: 1403 [2018-10-23 15:43:34,263 INFO L226 Difference]: Without dead ends: 1401 [2018-10-23 15:43:34,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=704, Invalid=7668, Unknown=0, NotChecked=0, Total=8372 [2018-10-23 15:43:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-10-23 15:43:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 978. [2018-10-23 15:43:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-23 15:43:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1092 transitions. [2018-10-23 15:43:34,453 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1092 transitions. Word has length 86 [2018-10-23 15:43:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:34,453 INFO L481 AbstractCegarLoop]: Abstraction has 978 states and 1092 transitions. [2018-10-23 15:43:34,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-23 15:43:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1092 transitions. [2018-10-23 15:43:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-23 15:43:34,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:34,454 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:34,454 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:34,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash -107471819, now seen corresponding path program 7 times [2018-10-23 15:43:34,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:34,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:34,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:34,862 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-23 15:43:35,141 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-23 15:43:35,406 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2018-10-23 15:43:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 5 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:36,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:36,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:36,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:36,639 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-23 15:43:36,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,643 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 23 treesize of output 37 [2018-10-23 15:43:36,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,661 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-23 15:43:36,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-23 15:43:36,804 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 36 treesize of output 29 [2018-10-23 15:43:36,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,817 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 29 treesize of output 70 [2018-10-23 15:43:36,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,840 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-23 15:43:36,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-10-23 15:43:36,949 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-23 15:43:36,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:36,959 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-23 15:43:36,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:36,982 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-23 15:43:36,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-23 15:43:37,025 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-23 15:43:37,028 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,029 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,030 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,035 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-23 15:43:37,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,058 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-23 15:43:37,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:30 [2018-10-23 15:43:37,100 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 34 treesize of output 27 [2018-10-23 15:43:37,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,105 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,111 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 27 treesize of output 64 [2018-10-23 15:43:37,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,131 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-23 15:43:37,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-10-23 15:43:37,288 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 37 treesize of output 29 [2018-10-23 15:43:37,290 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:37,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:37,293 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:37,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-10-23 15:43:37,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:37,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-23 15:43:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 6 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2018-10-23 15:43:37,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-23 15:43:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-23 15:43:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2018-10-23 15:43:37,384 INFO L87 Difference]: Start difference. First operand 978 states and 1092 transitions. Second operand 43 states. [2018-10-23 15:43:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:40,901 INFO L93 Difference]: Finished difference Result 1189 states and 1317 transitions. [2018-10-23 15:43:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-23 15:43:40,902 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2018-10-23 15:43:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:40,907 INFO L225 Difference]: With dead ends: 1189 [2018-10-23 15:43:40,907 INFO L226 Difference]: Without dead ends: 1187 [2018-10-23 15:43:40,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2018-10-23 15:43:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-10-23 15:43:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 993. [2018-10-23 15:43:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-10-23 15:43:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1109 transitions. [2018-10-23 15:43:41,106 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1109 transitions. Word has length 87 [2018-10-23 15:43:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:41,107 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1109 transitions. [2018-10-23 15:43:41,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-23 15:43:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1109 transitions. [2018-10-23 15:43:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-23 15:43:41,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:41,109 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:41,109 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:41,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1571272399, now seen corresponding path program 8 times [2018-10-23 15:43:41,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 15:43:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:41,495 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-23 15:43:41,724 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-23 15:43:41,961 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-23 15:43:42,214 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-23 15:43:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:43,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:43,049 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 15:43:43,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 15:43:43,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:43,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:43,368 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-23 15:43:43,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:43,372 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 23 treesize of output 37 [2018-10-23 15:43:43,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:43,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:43,390 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-23 15:43:43,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-10-23 15:43:43,470 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 18 [2018-10-23 15:43:43,472 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 18 treesize of output 10 [2018-10-23 15:43:43,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:43,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:43,476 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-23 15:43:43,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-23 15:43:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 45 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-23 15:43:43,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-23 15:43:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-23 15:43:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-10-23 15:43:43,606 INFO L87 Difference]: Start difference. First operand 993 states and 1109 transitions. Second operand 30 states. [2018-10-23 15:43:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:49,230 INFO L93 Difference]: Finished difference Result 1628 states and 1787 transitions. [2018-10-23 15:43:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-23 15:43:49,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-23 15:43:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:49,236 INFO L225 Difference]: With dead ends: 1628 [2018-10-23 15:43:49,236 INFO L226 Difference]: Without dead ends: 1556 [2018-10-23 15:43:49,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4679 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1472, Invalid=13290, Unknown=0, NotChecked=0, Total=14762 [2018-10-23 15:43:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-10-23 15:43:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1009. [2018-10-23 15:43:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-10-23 15:43:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1128 transitions. [2018-10-23 15:43:49,424 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1128 transitions. Word has length 87 [2018-10-23 15:43:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:49,425 INFO L481 AbstractCegarLoop]: Abstraction has 1009 states and 1128 transitions. [2018-10-23 15:43:49,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-23 15:43:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1128 transitions. [2018-10-23 15:43:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-23 15:43:49,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:49,426 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:49,426 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:49,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 144675661, now seen corresponding path program 6 times [2018-10-23 15:43:49,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:49,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:49,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:49,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:49,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:49,834 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 15:43:50,039 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-23 15:43:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:52,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:43:52,088 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:43:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-23 15:43:52,138 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-23 15:43:52,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 15:43:52,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:43:52,278 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 34 [2018-10-23 15:43:52,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:52,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,285 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-23 15:43:52,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,313 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-23 15:43:52,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-23 15:43:52,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,430 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 51 treesize of output 53 [2018-10-23 15:43:52,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-10-23 15:43:52,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,457 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-23 15:43:52,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-10-23 15:43:52,502 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 35 treesize of output 28 [2018-10-23 15:43:52,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,513 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 28 treesize of output 81 [2018-10-23 15:43:52,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,536 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-23 15:43:52,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-10-23 15:43:52,579 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 36 treesize of output 29 [2018-10-23 15:43:52,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,588 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 29 treesize of output 84 [2018-10-23 15:43:52,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,612 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-23 15:43:52,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-23 15:43:52,746 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 36 [2018-10-23 15:43:52,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,754 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:52,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 95 [2018-10-23 15:43:52,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:52,816 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-23 15:43:52,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-23 15:43:53,106 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,106 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 67 treesize of output 65 [2018-10-23 15:43:53,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 15:43:53,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 155 [2018-10-23 15:43:53,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-23 15:43:53,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:53,218 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-23 15:43:53,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2018-10-23 15:43:53,450 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 61 treesize of output 50 [2018-10-23 15:43:53,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 116 [2018-10-23 15:43:53,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:53,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:53,493 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-23 15:43:53,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:37 [2018-10-23 15:43:53,694 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-23 15:43:53,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-23 15:43:53,697 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-23 15:43:53,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 15:43:53,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 15:43:53,701 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-23 15:43:53,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-23 15:43:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 15:43:53,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 15:43:53,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31] total 50 [2018-10-23 15:43:53,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-23 15:43:53,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-23 15:43:53,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2018-10-23 15:43:53,806 INFO L87 Difference]: Start difference. First operand 1009 states and 1128 transitions. Second operand 50 states. [2018-10-23 15:43:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 15:43:58,694 INFO L93 Difference]: Finished difference Result 1360 states and 1513 transitions. [2018-10-23 15:43:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-23 15:43:58,695 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 88 [2018-10-23 15:43:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 15:43:58,700 INFO L225 Difference]: With dead ends: 1360 [2018-10-23 15:43:58,700 INFO L226 Difference]: Without dead ends: 1105 [2018-10-23 15:43:58,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 62 SyntacticMatches, 24 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=514, Invalid=6458, Unknown=0, NotChecked=0, Total=6972 [2018-10-23 15:43:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-10-23 15:43:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1000. [2018-10-23 15:43:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-10-23 15:43:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1118 transitions. [2018-10-23 15:43:58,916 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1118 transitions. Word has length 88 [2018-10-23 15:43:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 15:43:58,916 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1118 transitions. [2018-10-23 15:43:58,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-23 15:43:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1118 transitions. [2018-10-23 15:43:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-23 15:43:58,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 15:43:58,918 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, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 15:43:58,918 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 15:43:58,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 15:43:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash 704888511, now seen corresponding path program 7 times [2018-10-23 15:43:58,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 15:43:58,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 15:43:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:58,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 15:43:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 15:43:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:43:59,264 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-23 15:43:59,691 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 9 [2018-10-23 15:44:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 15:44:01,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 15:44:01,039 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:44:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Received shutdown request... [2018-10-23 15:44:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 15:44:01,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 15:44:01,083 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-23 15:44:01,284 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 15:44:01,284 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 15:44:01,290 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 15:44:01,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 03:44:01 BoogieIcfgContainer [2018-10-23 15:44:01,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 15:44:01,292 INFO L168 Benchmark]: Toolchain (without parser) took 236995.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.3 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:01,292 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 15:44:01,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:01,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.11 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-23 15:44:01,293 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 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-23 15:44:01,293 INFO L168 Benchmark]: RCFGBuilder took 558.10 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.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:01,294 INFO L168 Benchmark]: TraceAbstraction took 236035.03 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 14.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.1 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2018-10-23 15:44:01,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.11 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 27.25 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 558.10 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.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236035.03 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 14.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.1 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. TIMEOUT Result, 235.9s OverallTime, 48 OverallIterations, 7 TraceHistogramMax, 129.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2447 SDtfs, 16752 SDslu, 30804 SDs, 0 SdLazy, 54234 SolverSat, 4715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5565 GetRequests, 2207 SyntacticMatches, 353 SemanticMatches, 3005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80758 ImplicationChecksByTransitivity, 149.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1009occurred in iteration=46, 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: 3.3s AutomataMinimizationTime, 47 MinimizatonAttempts, 6290 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 95.5s InterpolantComputationTime, 5863 NumberOfCodeBlocks, 5851 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 5772 ConstructedInterpolants, 347 QuantifiedInterpolants, 7812644 SizeOfPredicates, 800 NumberOfNonLiveVariables, 5316 ConjunctsInSsa, 1565 ConjunctsInUnsatCore, 91 InterpolantComputations, 3 PerfectInterpolantSequences, 364/7374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown