java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:04:37,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:04:37,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:04:37,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:04:37,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:04:37,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:04:37,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:04:37,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:04:37,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:04:37,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:04:37,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:04:37,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:04:37,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:04:37,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:04:37,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:04:37,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:04:37,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:04:37,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:04:37,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:04:37,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:04:37,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:04:37,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:04:37,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:04:37,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:04:37,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:04:37,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:04:37,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:04:37,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:04:37,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:04:37,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:04:37,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:04:37,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:04:37,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:04:37,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:04:37,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:04:37,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:04:37,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:04:37,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:04:37,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:04:37,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:04:37,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:04:37,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:04:37,653 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:04:37,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:04:37,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:04:37,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:04:37,657 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:04:37,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:04:37,658 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:04:37,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:04:37,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:04:37,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:04:37,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:04:37,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:04:37,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:04:37,661 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:04:37,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:04:37,662 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:04:37,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:04:37,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:04:37,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:04:37,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:04:37,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:04:37,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:04:37,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:04:37,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:04:37,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:04:37,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:04:37,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:04:37,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:04:37,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:04:37,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:04:37,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:04:37,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:04:37,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:04:37,715 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:04:37,715 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-09-08 03:04:37,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b944cd5ca/593dfcf553b54f83b43caaf24f8a5d8e/FLAGc36b802dd [2019-09-08 03:04:38,194 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:04:38,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-09-08 03:04:38,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b944cd5ca/593dfcf553b54f83b43caaf24f8a5d8e/FLAGc36b802dd [2019-09-08 03:04:38,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b944cd5ca/593dfcf553b54f83b43caaf24f8a5d8e [2019-09-08 03:04:38,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:04:38,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:04:38,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:04:38,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:04:38,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:04:38,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:38,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cb8da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38, skipping insertion in model container [2019-09-08 03:04:38,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:38,623 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:04:38,642 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:04:38,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:04:38,883 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:04:38,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:04:38,915 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:04:38,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38 WrapperNode [2019-09-08 03:04:38,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:04:38,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:04:38,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:04:38,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:04:39,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... [2019-09-08 03:04:39,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:04:39,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:04:39,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:04:39,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:04:39,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:04:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:04:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:04:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 03:04:39,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:04:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:04:39,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:04:39,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:04:39,353 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 03:04:39,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:04:39 BoogieIcfgContainer [2019-09-08 03:04:39,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:04:39,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:04:39,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:04:39,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:04:39,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:04:38" (1/3) ... [2019-09-08 03:04:39,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a58890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:04:39, skipping insertion in model container [2019-09-08 03:04:39,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:04:38" (2/3) ... [2019-09-08 03:04:39,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a58890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:04:39, skipping insertion in model container [2019-09-08 03:04:39,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:04:39" (3/3) ... [2019-09-08 03:04:39,361 INFO L109 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2019-09-08 03:04:39,371 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:04:39,379 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:04:39,402 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:04:39,433 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:04:39,434 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:04:39,434 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:04:39,434 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:04:39,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:04:39,434 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:04:39,434 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:04:39,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:04:39,435 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:04:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 03:04:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 03:04:39,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:39,462 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:39,465 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1448943433, now seen corresponding path program 1 times [2019-09-08 03:04:39,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:04:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 03:04:39,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 03:04:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 03:04:39,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 03:04:39,620 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 03:04:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:39,643 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-08 03:04:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 03:04:39,644 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-08 03:04:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:39,652 INFO L225 Difference]: With dead ends: 41 [2019-09-08 03:04:39,653 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 03:04:39,656 INFO L628 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 [2019-09-08 03:04:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 03:04:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 03:04:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 03:04:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 03:04:39,698 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-09-08 03:04:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:39,699 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 03:04:39,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 03:04:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 03:04:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 03:04:39,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:39,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:39,703 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1815969073, now seen corresponding path program 1 times [2019-09-08 03:04:39,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:39,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:04:39,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:04:39,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:04:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:04:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:04:39,833 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-09-08 03:04:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:39,910 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 03:04:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:04:39,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 03:04:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:39,913 INFO L225 Difference]: With dead ends: 34 [2019-09-08 03:04:39,913 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 03:04:39,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:04:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 03:04:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 03:04:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 03:04:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 03:04:39,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-09-08 03:04:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:39,927 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 03:04:39,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:04:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 03:04:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 03:04:39,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:39,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:39,929 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1419508495, now seen corresponding path program 1 times [2019-09-08 03:04:39,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:39,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:40,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:40,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:04:40,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:40,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:04:40,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:40,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-08 03:04:40,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:40,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:40,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:40,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-09-08 03:04:40,480 INFO L375 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 15 treesize of output 7 [2019-09-08 03:04:40,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:40,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:40,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:40,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-09-08 03:04:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:40,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-08 03:04:40,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:04:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:04:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:04:40,546 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 15 states. [2019-09-08 03:04:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:40,878 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-08 03:04:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:04:40,878 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-09-08 03:04:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:40,880 INFO L225 Difference]: With dead ends: 40 [2019-09-08 03:04:40,881 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 03:04:40,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:04:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 03:04:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-08 03:04:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 03:04:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 03:04:40,892 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2019-09-08 03:04:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:40,892 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 03:04:40,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:04:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 03:04:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 03:04:40,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:40,894 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:40,894 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2113189724, now seen corresponding path program 1 times [2019-09-08 03:04:40,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:40,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:41,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:41,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:41,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:41,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 03:04:41,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:41,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:04:41,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:41,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:41,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 03:04:41,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-08 03:04:43,292 INFO L375 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 19 treesize of output 7 [2019-09-08 03:04:43,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:43,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:43,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:43,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 03:04:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:04:43,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:43,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-08 03:04:43,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:04:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:04:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2019-09-08 03:04:43,351 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-09-08 03:04:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:46,168 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-08 03:04:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:04:46,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-08 03:04:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:46,172 INFO L225 Difference]: With dead ends: 42 [2019-09-08 03:04:46,172 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 03:04:46,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=63, Invalid=278, Unknown=1, NotChecked=0, Total=342 [2019-09-08 03:04:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 03:04:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-09-08 03:04:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 03:04:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-08 03:04:46,183 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2019-09-08 03:04:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:46,184 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-08 03:04:46,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:04:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-08 03:04:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 03:04:46,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:46,187 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:46,187 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:46,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1564012763, now seen corresponding path program 2 times [2019-09-08 03:04:46,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:46,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:46,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:04:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:46,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:46,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:04:46,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:04:46,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:46,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:04:46,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:04:46,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:46,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-08 03:04:46,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:04:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:04:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:04:46,478 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2019-09-08 03:04:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:46,596 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-09-08 03:04:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:04:46,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-08 03:04:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:46,599 INFO L225 Difference]: With dead ends: 60 [2019-09-08 03:04:46,600 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 03:04:46,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:04:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 03:04:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 03:04:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 03:04:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 03:04:46,609 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2019-09-08 03:04:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:46,610 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 03:04:46,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:04:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 03:04:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 03:04:46,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:46,611 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:46,611 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 119264185, now seen corresponding path program 3 times [2019-09-08 03:04:46,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:46,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:04:46,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:46,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:46,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:04:46,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 03:04:46,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:46,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 03:04:46,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:46,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-09-08 03:04:46,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:46,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:46,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:46,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-08 03:04:47,147 INFO L375 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 15 treesize of output 7 [2019-09-08 03:04:47,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:47,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:47,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:47,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 03:04:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:04:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-09-08 03:04:47,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 03:04:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 03:04:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:04:47,194 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 23 states. [2019-09-08 03:04:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:47,514 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-09-08 03:04:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:04:47,514 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-09-08 03:04:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:47,515 INFO L225 Difference]: With dead ends: 52 [2019-09-08 03:04:47,516 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 03:04:47,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:04:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 03:04:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-08 03:04:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 03:04:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-08 03:04:47,526 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2019-09-08 03:04:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:47,526 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-08 03:04:47,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 03:04:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-08 03:04:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 03:04:47,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:47,528 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:47,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash 606836464, now seen corresponding path program 4 times [2019-09-08 03:04:47,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:47,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:47,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:04:47,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:47,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:04:47,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:47,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:04:47,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 03:04:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:04:47,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-09-08 03:04:47,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:04:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:04:47,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:04:47,777 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states. [2019-09-08 03:04:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:47,934 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-08 03:04:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:04:47,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-09-08 03:04:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:47,936 INFO L225 Difference]: With dead ends: 74 [2019-09-08 03:04:47,936 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 03:04:47,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:04:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 03:04:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 03:04:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 03:04:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-08 03:04:47,953 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-09-08 03:04:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:47,953 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-08 03:04:47,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:04:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-08 03:04:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 03:04:47,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:47,955 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:47,955 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1605303374, now seen corresponding path program 5 times [2019-09-08 03:04:47,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:47,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:47,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:04:48,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:48,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:04:48,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:04:48,225 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-08 03:04:48,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:48,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:04:48,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:48,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-09-08 03:04:48,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:48,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:48,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:48,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-08 03:04:48,628 INFO L375 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 15 treesize of output 7 [2019-09-08 03:04:48,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:48,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:48,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:04:48,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 03:04:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:04:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-09-08 03:04:48,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 03:04:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 03:04:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:04:48,675 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 27 states. [2019-09-08 03:04:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:49,235 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-08 03:04:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:04:49,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2019-09-08 03:04:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:49,239 INFO L225 Difference]: With dead ends: 62 [2019-09-08 03:04:49,239 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 03:04:49,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:04:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 03:04:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-08 03:04:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 03:04:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-08 03:04:49,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2019-09-08 03:04:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:49,248 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-08 03:04:49,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 03:04:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-08 03:04:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 03:04:49,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:49,249 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:49,249 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash 921393797, now seen corresponding path program 6 times [2019-09-08 03:04:49,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:49,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:49,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:49,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:49,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:04:49,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:49,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:04:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:04:49,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 03:04:49,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:04:49,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 03:04:49,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:04:49,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:04:49,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-09-08 03:04:49,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:04:49,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:04:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:04:49,541 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-09-08 03:04:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:04:49,748 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-09-08 03:04:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:04:49,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-09-08 03:04:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:04:49,755 INFO L225 Difference]: With dead ends: 88 [2019-09-08 03:04:49,755 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 03:04:49,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-09-08 03:04:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 03:04:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-08 03:04:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 03:04:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-08 03:04:49,765 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2019-09-08 03:04:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:04:49,766 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-08 03:04:49,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:04:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-08 03:04:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 03:04:49,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:04:49,767 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:04:49,768 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:04:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:04:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash 288236131, now seen corresponding path program 7 times [2019-09-08 03:04:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:04:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:04:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:49,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:04:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:04:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:04:50,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:04:50,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:04:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:04:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:04:50,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:04:50,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:04:50,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:04:50,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:04:50,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:04:50,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 03:04:50,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-08 03:05:24,108 INFO L375 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 19 treesize of output 7 [2019-09-08 03:05:24,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:05:24,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:05:24,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:05:24,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 03:05:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:05:24,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:24,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-09-08 03:05:24,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 03:05:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 03:05:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=483, Unknown=4, NotChecked=0, Total=552 [2019-09-08 03:05:24,161 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-09-08 03:05:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:33,104 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-08 03:05:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:05:33,105 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-09-08 03:05:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:33,106 INFO L225 Difference]: With dead ends: 72 [2019-09-08 03:05:33,106 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 03:05:33,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=90, Invalid=662, Unknown=4, NotChecked=0, Total=756 [2019-09-08 03:05:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 03:05:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-09-08 03:05:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 03:05:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-08 03:05:33,115 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2019-09-08 03:05:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:33,116 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-08 03:05:33,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 03:05:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-08 03:05:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 03:05:33,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:33,117 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:33,117 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:33,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1266785178, now seen corresponding path program 8 times [2019-09-08 03:05:33,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:33,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:33,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:05:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:05:33,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:33,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:05:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:05:33,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:05:33,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:33,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:05:33,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:05:33,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:33,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-09-08 03:05:33,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 03:05:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 03:05:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-09-08 03:05:33,448 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 22 states. [2019-09-08 03:05:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:33,669 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-09-08 03:05:33,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:05:33,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-09-08 03:05:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:33,671 INFO L225 Difference]: With dead ends: 102 [2019-09-08 03:05:33,671 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 03:05:33,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:05:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 03:05:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-08 03:05:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 03:05:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-08 03:05:33,690 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2019-09-08 03:05:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:33,691 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-08 03:05:33,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 03:05:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-08 03:05:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 03:05:33,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:33,694 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:33,695 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526280, now seen corresponding path program 9 times [2019-09-08 03:05:33,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:33,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:33,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:05:34,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:34,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:05:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:05:34,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-08 03:05:34,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:34,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 03:05:34,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:34,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:05:34,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:05:34,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:05:34,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:05:34,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-08 03:05:37,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:05:37,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-08 03:05:37,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 03:05:37,238 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-08 03:05:37,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:05:37,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-08 03:05:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:05:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:05:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-09-08 03:05:37,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 03:05:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 03:05:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:05:37,307 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 37 states. [2019-09-08 03:05:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:05:58,809 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2019-09-08 03:05:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:05:58,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2019-09-08 03:05:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:05:58,810 INFO L225 Difference]: With dead ends: 130 [2019-09-08 03:05:58,810 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 03:05:58,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=384, Invalid=3398, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 03:05:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 03:05:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-09-08 03:05:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 03:05:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-08 03:05:58,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2019-09-08 03:05:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:05:58,821 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-08 03:05:58,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 03:05:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-08 03:05:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 03:05:58,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:05:58,822 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:05:58,823 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:05:58,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:05:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash -679833386, now seen corresponding path program 10 times [2019-09-08 03:05:58,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:05:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:05:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:58,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:05:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:05:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:05:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 11 proven. 98 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:05:59,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:05:59,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:05:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:05:59,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:05:59,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:05:59,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 03:05:59,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:05:59,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:05:59,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:05:59,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:05:59,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:05:59,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-09-08 03:05:59,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:05:59,303 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 62 [2019-09-08 03:05:59,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:05:59,331 INFO L567 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2019-09-08 03:05:59,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 03:05:59,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-09-08 03:06:09,077 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-08 03:06:11,130 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-08 03:06:18,403 WARN L188 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2019-09-08 03:06:23,121 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-08 03:06:23,872 WARN L188 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-09-08 03:06:31,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:06:31,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2019-09-08 03:06:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:06:31,318 INFO L567 ElimStorePlain]: treesize reduction 25, result has 37.5 percent of original size [2019-09-08 03:06:31,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:06:31,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-09-08 03:06:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 109 refuted. 24 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:06:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:06:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 35 [2019-09-08 03:06:31,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 03:06:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 03:06:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1041, Unknown=5, NotChecked=0, Total=1190 [2019-09-08 03:06:31,417 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states. [2019-09-08 03:06:32,177 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:06:33,290 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 03:06:43,176 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-08 03:06:52,095 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 03:07:10,321 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-08 03:07:14,778 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-08 03:07:23,817 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-08 03:07:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:34,992 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-08 03:07:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:07:34,996 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-09-08 03:07:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:34,997 INFO L225 Difference]: With dead ends: 85 [2019-09-08 03:07:34,997 INFO L226 Difference]: Without dead ends: 83 [2019-09-08 03:07:34,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=266, Invalid=1797, Unknown=7, NotChecked=0, Total=2070 [2019-09-08 03:07:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-08 03:07:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-08 03:07:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 03:07:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-08 03:07:35,008 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 68 [2019-09-08 03:07:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:35,008 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-08 03:07:35,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 03:07:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-08 03:07:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 03:07:35,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:35,010 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:35,010 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash 138274573, now seen corresponding path program 11 times [2019-09-08 03:07:35,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:35,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 03:07:35,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:35,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:07:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:07:35,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 03:07:35,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:35,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 03:07:35,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:35,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-09-08 03:07:35,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:07:35,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:07:35,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:07:35,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-08 03:07:36,503 INFO L375 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 15 treesize of output 7 [2019-09-08 03:07:36,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:07:36,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:07:36,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:07:36,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 03:07:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 03:07:36,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:36,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2019-09-08 03:07:36,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 03:07:36,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 03:07:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 03:07:36,572 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 39 states. [2019-09-08 03:07:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:37,477 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-09-08 03:07:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 03:07:37,478 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-09-08 03:07:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:37,479 INFO L225 Difference]: With dead ends: 92 [2019-09-08 03:07:37,479 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 03:07:37,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 03:07:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 03:07:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-09-08 03:07:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 03:07:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-08 03:07:37,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2019-09-08 03:07:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:37,491 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-08 03:07:37,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 03:07:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-08 03:07:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 03:07:37,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:37,492 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:37,492 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1644227004, now seen corresponding path program 12 times [2019-09-08 03:07:37,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:37,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:07:37,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:37,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:07:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:07:37,755 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-08 03:07:37,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:07:37,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 03:07:37,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:07:37,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:07:37,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-09-08 03:07:37,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 03:07:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 03:07:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:07:37,929 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 28 states. [2019-09-08 03:07:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:07:38,305 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-09-08 03:07:38,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:07:38,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2019-09-08 03:07:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:07:38,307 INFO L225 Difference]: With dead ends: 130 [2019-09-08 03:07:38,307 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 03:07:38,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=1026, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:07:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 03:07:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-08 03:07:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-08 03:07:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-08 03:07:38,327 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2019-09-08 03:07:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:07:38,327 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-08 03:07:38,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 03:07:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-08 03:07:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 03:07:38,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:07:38,329 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:07:38,329 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:07:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:07:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1370929758, now seen corresponding path program 13 times [2019-09-08 03:07:38,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:07:38,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:07:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:38,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:07:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:07:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:07:38,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:07:38,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:07:38,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:07:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:07:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 03:07:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:07:38,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:07:38,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:07:38,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:07:38,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 03:07:38,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-08 03:08:38,673 INFO L375 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 19 treesize of output 7 [2019-09-08 03:08:38,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:08:38,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:08:38,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:08:38,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 03:08:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 03:08:38,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:08:38,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2019-09-08 03:08:38,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 03:08:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 03:08:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=957, Unknown=7, NotChecked=0, Total=1056 [2019-09-08 03:08:38,750 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 33 states. [2019-09-08 03:08:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:08:53,621 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-09-08 03:08:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:08:53,621 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2019-09-08 03:08:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:08:53,622 INFO L225 Difference]: With dead ends: 102 [2019-09-08 03:08:53,623 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 03:08:53,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=117, Invalid=1208, Unknown=7, NotChecked=0, Total=1332 [2019-09-08 03:08:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 03:08:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-09-08 03:08:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-08 03:08:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-08 03:08:53,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2019-09-08 03:08:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:08:53,633 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-08 03:08:53,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 03:08:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-08 03:08:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 03:08:53,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:08:53,635 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:08:53,635 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:08:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:08:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1973489625, now seen corresponding path program 14 times [2019-09-08 03:08:53,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:08:53,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:08:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:08:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:08:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:08:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:08:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:08:53,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:08:53,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:08:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:08:53,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:08:53,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:08:53,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 03:08:53,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:08:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:08:54,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:08:54,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2019-09-08 03:08:54,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 03:08:54,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 03:08:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:08:54,088 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 31 states. [2019-09-08 03:08:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:08:54,380 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-09-08 03:08:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:08:54,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-09-08 03:08:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:08:54,381 INFO L225 Difference]: With dead ends: 144 [2019-09-08 03:08:54,381 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 03:08:54,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1266, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 03:08:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 03:08:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-08 03:08:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 03:08:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-09-08 03:08:54,393 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2019-09-08 03:08:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:08:54,393 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-09-08 03:08:54,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 03:08:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-09-08 03:08:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 03:08:54,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:08:54,394 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:08:54,395 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:08:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:08:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash -633986633, now seen corresponding path program 15 times [2019-09-08 03:08:54,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:08:54,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:08:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:08:54,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:08:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:08:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:08:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:08:54,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:08:54,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:08:54,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:08:54,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 03:08:54,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:08:54,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:08:54,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:08:55,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:08:55,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:08:55,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:08:55,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:08:55,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-08 03:08:58,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:08:58,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-08 03:08:58,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 03:08:58,554 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-08 03:08:58,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:08:58,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-08 03:08:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:08:58,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:08:58,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 49 [2019-09-08 03:08:58,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 03:08:58,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 03:08:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:08:58,705 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2019-09-08 03:09:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:09:07,405 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-09-08 03:09:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 03:09:07,405 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-09-08 03:09:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:09:07,406 INFO L225 Difference]: With dead ends: 152 [2019-09-08 03:09:07,407 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 03:09:07,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 15 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=644, Invalid=6328, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 03:09:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 03:09:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2019-09-08 03:09:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-08 03:09:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-09-08 03:09:07,420 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 96 [2019-09-08 03:09:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:09:07,421 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-09-08 03:09:07,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 03:09:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-09-08 03:09:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 03:09:07,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:09:07,422 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:09:07,422 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:09:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:09:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1424630964, now seen corresponding path program 16 times [2019-09-08 03:09:07,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:09:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:09:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:07,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:09:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:09:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 03:09:07,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:09:07,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:09:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:09:07,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:09:07,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:09:07,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 03:09:07,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:09:08,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-09-08 03:09:08,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:09:08,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:09:08,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:09:08,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-08 03:09:09,688 INFO L375 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 15 treesize of output 7 [2019-09-08 03:09:09,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:09:09,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:09:09,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:09:09,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 03:09:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-08 03:09:09,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:09:09,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2019-09-08 03:09:09,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 03:09:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 03:09:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2394, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 03:09:09,784 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 51 states. [2019-09-08 03:09:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:09:11,767 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-09-08 03:09:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 03:09:11,768 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-08 03:09:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:09:11,769 INFO L225 Difference]: With dead ends: 122 [2019-09-08 03:09:11,769 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 03:09:11,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 17 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=190, Invalid=2890, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 03:09:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 03:09:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-09-08 03:09:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 03:09:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-09-08 03:09:11,783 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2019-09-08 03:09:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:09:11,784 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-09-08 03:09:11,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 03:09:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-09-08 03:09:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 03:09:11,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:09:11,785 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:09:11,785 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:09:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:09:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 813325187, now seen corresponding path program 17 times [2019-09-08 03:09:11,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:09:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:09:11,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:11,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:09:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:09:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 183 proven. 137 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 03:09:12,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:09:12,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:09:12,051 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:09:12,177 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-08 03:09:12,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:09:12,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 03:09:12,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:09:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 03:09:12,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:09:12,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2019-09-08 03:09:12,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 03:09:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 03:09:12,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1027, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:09:12,460 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 37 states. [2019-09-08 03:09:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:09:13,049 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2019-09-08 03:09:13,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:09:13,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2019-09-08 03:09:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:09:13,051 INFO L225 Difference]: With dead ends: 172 [2019-09-08 03:09:13,051 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 03:09:13,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=531, Invalid=1821, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:09:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 03:09:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-08 03:09:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 03:09:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-08 03:09:13,065 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2019-09-08 03:09:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:09:13,065 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-08 03:09:13,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 03:09:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-08 03:09:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 03:09:13,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:09:13,067 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:09:13,067 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:09:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:09:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1920871839, now seen corresponding path program 18 times [2019-09-08 03:09:13,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:09:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:09:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:13,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:09:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:09:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 03:09:13,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:09:13,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:09:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:09:13,822 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-08 03:09:13,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:09:13,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 03:09:13,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:09:14,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:09:14,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:09:14,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:09:14,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:09:14,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-08 03:09:17,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:09:17,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-08 03:09:17,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 03:09:17,385 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-08 03:09:17,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:09:17,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-08 03:09:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 217 proven. 151 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-08 03:09:17,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:09:17,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33] total 59 [2019-09-08 03:09:17,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 03:09:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 03:09:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=3080, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 03:09:17,511 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 59 states. [2019-09-08 03:09:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:09:36,882 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2019-09-08 03:09:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 03:09:36,883 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-09-08 03:09:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:09:36,884 INFO L225 Difference]: With dead ends: 200 [2019-09-08 03:09:36,884 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 03:09:36,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 68 SyntacticMatches, 19 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1147, Invalid=14603, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 03:09:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 03:09:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-09-08 03:09:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-08 03:09:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-09-08 03:09:36,911 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 116 [2019-09-08 03:09:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:09:36,911 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-09-08 03:09:36,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 03:09:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-09-08 03:09:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:09:36,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:09:36,912 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:09:36,912 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:09:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:09:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 832268022, now seen corresponding path program 19 times [2019-09-08 03:09:36,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:09:36,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:09:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:36,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:09:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:09:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:09:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 03:09:37,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:09:37,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:09:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:09:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:09:37,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 03:09:37,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:09:37,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:09:37,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:09:37,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:09:37,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 03:09:37,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-09-08 03:12:16,301 INFO L375 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 19 treesize of output 7 [2019-09-08 03:12:16,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:12:16,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:12:16,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:12:16,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-08 03:12:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-08 03:12:16,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:12:16,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 45 [2019-09-08 03:12:16,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 03:12:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 03:12:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1841, Unknown=11, NotChecked=0, Total=1980 [2019-09-08 03:12:16,413 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 45 states. [2019-09-08 03:12:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:12:39,142 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-09-08 03:12:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 03:12:39,146 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-09-08 03:12:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:12:39,147 INFO L225 Difference]: With dead ends: 142 [2019-09-08 03:12:39,147 INFO L226 Difference]: Without dead ends: 140 [2019-09-08 03:12:39,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 90 SyntacticMatches, 23 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 159.3s TimeCoverageRelationStatistics Valid=153, Invalid=2188, Unknown=11, NotChecked=0, Total=2352 [2019-09-08 03:12:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-08 03:12:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-09-08 03:12:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-08 03:12:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-09-08 03:12:39,160 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2019-09-08 03:12:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:12:39,160 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-09-08 03:12:39,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 03:12:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-09-08 03:12:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 03:12:39,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:12:39,161 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:12:39,162 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:12:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:12:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -4809427, now seen corresponding path program 20 times [2019-09-08 03:12:39,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:12:39,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:12:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:12:39,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:12:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:12:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:12:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 267 proven. 189 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:12:39,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:12:39,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:12:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:12:39,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:12:39,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:12:39,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 03:12:39,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:12:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:12:39,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:12:39,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2019-09-08 03:12:39,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 03:12:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 03:12:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 03:12:39,886 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 43 states. [2019-09-08 03:12:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:12:40,558 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2019-09-08 03:12:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 03:12:40,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 134 [2019-09-08 03:12:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:12:40,564 INFO L225 Difference]: With dead ends: 200 [2019-09-08 03:12:40,564 INFO L226 Difference]: Without dead ends: 140 [2019-09-08 03:12:40,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=716, Invalid=2476, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 03:12:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-08 03:12:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-08 03:12:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 03:12:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-09-08 03:12:40,584 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2019-09-08 03:12:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:12:40,585 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-09-08 03:12:40,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 03:12:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-09-08 03:12:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:12:40,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:12:40,587 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:12:40,587 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:12:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:12:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 17561867, now seen corresponding path program 21 times [2019-09-08 03:12:40,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:12:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:12:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:12:40,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:12:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:12:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:12:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:12:41,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:12:41,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:12:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:12:41,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-08 03:12:41,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:12:41,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 03:12:41,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:12:42,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:12:42,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:12:42,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:12:42,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:12:42,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-09-08 03:12:45,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 03:12:45,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:12:45,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2019-09-08 03:12:45,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:12:45,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:12:45,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:12:45,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-09-08 03:12:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 231 proven. 250 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:12:45,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:12:45,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 65 [2019-09-08 03:12:45,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 03:12:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 03:12:45,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=3853, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 03:12:45,409 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 65 states. [2019-09-08 03:12:51,621 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:12:53,473 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:12:55,555 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:12:57,638 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:12:59,720 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:13:01,836 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:13:03,927 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:13:06,010 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:13:08,093 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 03:13:10,179 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-08 03:13:12,275 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 03:13:14,362 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 03:13:16,441 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-08 03:13:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:13:16,511 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2019-09-08 03:13:16,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 03:13:16,512 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 136 [2019-09-08 03:13:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:13:16,514 INFO L225 Difference]: With dead ends: 208 [2019-09-08 03:13:16,514 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 03:13:16,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 82 SyntacticMatches, 23 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3692 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1040, Invalid=14710, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 03:13:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 03:13:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-09-08 03:13:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-08 03:13:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-09-08 03:13:16,529 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 136 [2019-09-08 03:13:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:13:16,530 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-09-08 03:13:16,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 03:13:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-09-08 03:13:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:13:16,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:13:16,531 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:13:16,531 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:13:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:13:16,531 INFO L82 PathProgramCache]: Analyzing trace with hash 352643232, now seen corresponding path program 22 times [2019-09-08 03:13:16,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:13:16,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:13:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:16,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:13:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:13:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 03:13:17,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:13:17,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:13:17,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 03:13:17,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:13:17,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:13:17,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 03:13:17,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:13:18,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-09-08 03:13:18,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:13:18,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:13:18,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:13:18,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-09-08 03:13:20,237 INFO L375 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 15 treesize of output 7 [2019-09-08 03:13:20,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:13:20,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:13:20,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:13:20,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 03:13:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-08 03:13:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:13:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2019-09-08 03:13:20,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 03:13:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 03:13:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4214, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 03:13:20,389 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 67 states. [2019-09-08 03:13:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:13:22,973 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2019-09-08 03:13:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 03:13:22,974 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 146 [2019-09-08 03:13:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:13:22,975 INFO L225 Difference]: With dead ends: 162 [2019-09-08 03:13:22,975 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 03:13:22,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 90 SyntacticMatches, 25 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=242, Invalid=4870, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 03:13:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 03:13:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-09-08 03:13:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-08 03:13:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-09-08 03:13:22,993 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2019-09-08 03:13:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:13:22,993 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-09-08 03:13:22,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 03:13:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-09-08 03:13:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 03:13:22,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:13:22,994 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:13:22,995 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:13:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:13:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1535169751, now seen corresponding path program 23 times [2019-09-08 03:13:22,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:13:22,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:13:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:22,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:13:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:13:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 367 proven. 249 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 03:13:23,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:13:23,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:13:23,423 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:13:23,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-08 03:13:23,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:13:23,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 03:13:23,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:13:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 03:13:24,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:13:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2019-09-08 03:13:24,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 03:13:24,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 03:13:24,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=1819, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:13:24,097 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 49 states. [2019-09-08 03:13:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:13:24,632 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2019-09-08 03:13:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 03:13:24,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 154 [2019-09-08 03:13:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:13:24,633 INFO L225 Difference]: With dead ends: 228 [2019-09-08 03:13:24,633 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 03:13:24,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=929, Invalid=3231, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 03:13:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 03:13:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-08 03:13:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 03:13:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-08 03:13:24,654 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2019-09-08 03:13:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:13:24,654 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-08 03:13:24,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 03:13:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-08 03:13:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:13:24,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:13:24,655 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:13:24,656 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:13:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:13:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1405119051, now seen corresponding path program 24 times [2019-09-08 03:13:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:13:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:13:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:24,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:13:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:13:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:13:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 03:13:25,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:13:25,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:13:25,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 03:13:25,824 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-08 03:13:25,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:13:25,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 03:13:25,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:13:26,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:13:26,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:13:26,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:13:26,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:13:26,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-09-08 03:13:30,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:13:30,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-09-08 03:13:30,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-08 03:13:30,819 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-09-08 03:13:30,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 03:13:30,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-08 03:13:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 378 proven. 267 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 03:13:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:13:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 73 [2019-09-08 03:13:31,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 03:13:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 03:13:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=4723, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 03:13:31,004 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 73 states. [2019-09-08 03:14:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:14:04,907 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2019-09-08 03:14:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 03:14:04,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2019-09-08 03:14:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:14:04,910 INFO L225 Difference]: With dead ends: 292 [2019-09-08 03:14:04,910 INFO L226 Difference]: Without dead ends: 172 [2019-09-08 03:14:04,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 94 SyntacticMatches, 27 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4552 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1362, Invalid=17820, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 03:14:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-08 03:14:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2019-09-08 03:14:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-08 03:14:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-08 03:14:04,930 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 156 [2019-09-08 03:14:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:14:04,930 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-08 03:14:04,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 03:14:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-08 03:14:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 03:14:04,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:14:04,931 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:14:04,932 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:14:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:14:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 553476170, now seen corresponding path program 25 times [2019-09-08 03:14:04,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:14:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:14:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:14:04,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:14:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:14:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:14:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 30 proven. 706 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-08 03:14:06,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:14:06,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-08 03:14:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:14:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:14:06,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 03:14:06,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:14:06,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-09-08 03:14:06,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 03:14:06,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 03:14:06,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 03:14:06,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18