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-673a906-m [2019-10-02 11:20:05,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:20:05,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:20:05,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:20:05,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:20:05,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:20:05,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:20:05,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:20:05,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:20:05,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:20:05,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:20:05,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:20:05,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:20:05,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:20:05,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:20:05,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:20:05,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:20:05,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:20:05,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:20:05,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:20:05,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:20:05,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:20:05,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:20:05,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:20:05,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:20:05,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:20:05,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:20:05,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:20:05,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:20:05,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:20:05,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:20:05,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:20:05,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:20:05,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:20:05,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:20:05,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:20:05,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:20:05,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:20:05,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:20:05,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:20:05,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:20:05,402 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-10-02 11:20:05,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:20:05,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:20:05,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:20:05,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:20:05,418 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:20:05,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:20:05,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:20:05,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:20:05,420 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:20:05,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:20:05,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:20:05,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:20:05,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:20:05,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:20:05,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:20:05,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:20:05,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:20:05,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:20:05,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:20:05,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:20:05,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:20:05,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:20:05,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:20:05,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:20:05,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:20:05,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:20:05,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:20:05,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:20:05,472 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:20:05,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-02 11:20:05,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67a7dfa7/946cc72617e546069d7b142a9455c19a/FLAG5adea8064 [2019-10-02 11:20:05,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:20:05,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-02 11:20:05,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67a7dfa7/946cc72617e546069d7b142a9455c19a/FLAG5adea8064 [2019-10-02 11:20:06,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67a7dfa7/946cc72617e546069d7b142a9455c19a [2019-10-02 11:20:06,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:20:06,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:20:06,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:20:06,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:20:06,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:20:06,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17644812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06, skipping insertion in model container [2019-10-02 11:20:06,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:20:06,412 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:20:06,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:20:06,631 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:20:06,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:20:06,664 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:20:06,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06 WrapperNode [2019-10-02 11:20:06,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:20:06,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:20:06,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:20:06,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:20:06,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (1/1) ... [2019-10-02 11:20:06,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:20:06,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:20:06,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:20:06,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:20:06,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (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-10-02 11:20:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:20:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:20:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:20:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:20:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:20:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:20:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:20:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:20:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:20:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:20:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:20:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:20:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:20:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:20:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:20:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:20:07,069 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:20:07,069 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:20:07,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:20:07 BoogieIcfgContainer [2019-10-02 11:20:07,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:20:07,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:20:07,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:20:07,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:20:07,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:20:06" (1/3) ... [2019-10-02 11:20:07,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48518b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:20:07, skipping insertion in model container [2019-10-02 11:20:07,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:20:06" (2/3) ... [2019-10-02 11:20:07,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48518b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:20:07, skipping insertion in model container [2019-10-02 11:20:07,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:20:07" (3/3) ... [2019-10-02 11:20:07,091 INFO L109 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2019-10-02 11:20:07,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:20:07,117 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:20:07,133 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:20:07,157 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:20:07,158 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:20:07,158 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:20:07,158 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:20:07,158 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:20:07,158 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:20:07,158 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:20:07,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:20:07,158 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:20:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-02 11:20:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:20:07,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:07,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:07,180 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1448943433, now seen corresponding path program 1 times [2019-10-02 11:20:07,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:07,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:20:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:20:07,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:20:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:20:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:20:07,331 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-02 11:20:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:07,351 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-10-02 11:20:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:20:07,353 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 11:20:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:07,360 INFO L225 Difference]: With dead ends: 41 [2019-10-02 11:20:07,361 INFO L226 Difference]: Without dead ends: 20 [2019-10-02 11:20:07,364 INFO L640 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-10-02 11:20:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-02 11:20:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-02 11:20:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-02 11:20:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-02 11:20:07,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-10-02 11:20:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:07,401 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-02 11:20:07,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:20:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-02 11:20:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:20:07,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:07,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:07,403 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1815969073, now seen corresponding path program 1 times [2019-10-02 11:20:07,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:07,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:07,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:20:07,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:20:07,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:20:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:20:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:20:07,530 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-10-02 11:20:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:07,585 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-02 11:20:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:20:07,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-02 11:20:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:07,587 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:20:07,587 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:20:07,588 INFO L640 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-10-02 11:20:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:20:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-02 11:20:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:20:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-02 11:20:07,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-10-02 11:20:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:07,595 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-02 11:20:07,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:20:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-02 11:20:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:20:07,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:07,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:07,596 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1419508495, now seen corresponding path program 1 times [2019-10-02 11:20:07,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:07,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:07,900 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:07,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:20:07,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:08,059 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-10-02 11:20:08,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:08,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:08,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:08,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-02 11:20:08,115 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-10-02 11:20:08,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:08,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:08,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:08,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-02 11:20:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-02 11:20:08,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:20:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:20:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:20:08,171 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 15 states. [2019-10-02 11:20:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:08,460 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-02 11:20:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:20:08,461 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-10-02 11:20:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:08,464 INFO L225 Difference]: With dead ends: 43 [2019-10-02 11:20:08,464 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:20:08,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:20:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:20:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-02 11:20:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:20:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-02 11:20:08,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2019-10-02 11:20:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:08,478 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-02 11:20:08,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:20:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-02 11:20:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:20:08,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:08,479 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:08,480 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 764545094, now seen corresponding path program 1 times [2019-10-02 11:20:08,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:08,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:08,566 INFO L224 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-10-02 11:20:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:08,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:20:08,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-10-02 11:20:08,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:20:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:20:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:20:08,670 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2019-10-02 11:20:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:08,749 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-02 11:20:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:20:08,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-02 11:20:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:08,752 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:20:08,753 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 11:20:08,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:20:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 11:20:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 11:20:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:20:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-02 11:20:08,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2019-10-02 11:20:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:08,760 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-02 11:20:08,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:20:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-02 11:20:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:20:08,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:08,762 INFO L411 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-10-02 11:20:08,762 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2113189724, now seen corresponding path program 2 times [2019-10-02 11:20:08,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:08,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:08,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:08,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:08,929 INFO L224 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) [2019-10-02 11:20:08,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:08,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:20:08,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:08,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:20:08,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:09,023 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-10-02 11:20:09,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:09,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:09,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:09,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 11:20:09,169 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-10-02 11:20:09,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:09,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:09,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:09,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:20:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:20:09,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:09,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-10-02 11:20:09,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:20:09,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:20:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:20:09,218 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2019-10-02 11:20:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:09,489 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-10-02 11:20:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:20:09,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-10-02 11:20:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:09,491 INFO L225 Difference]: With dead ends: 42 [2019-10-02 11:20:09,491 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:20:09,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:20:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:20:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-02 11:20:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 11:20:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-02 11:20:09,499 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2019-10-02 11:20:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:09,499 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-02 11:20:09,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:20:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-02 11:20:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:20:09,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:09,501 INFO L411 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-10-02 11:20:09,501 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1564012763, now seen corresponding path program 3 times [2019-10-02 11:20:09,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:09,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:20:09,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:09,592 INFO L224 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) [2019-10-02 11:20:09,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:09,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:20:09,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:09,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:20:09,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:20:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-10-02 11:20:09,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:20:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:20:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:20:09,710 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2019-10-02 11:20:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:09,826 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-10-02 11:20:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:20:09,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-10-02 11:20:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:09,829 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:20:09,829 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:20:09,830 INFO L640 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-10-02 11:20:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:20:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 11:20:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:20:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-02 11:20:09,842 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2019-10-02 11:20:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:09,843 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-02 11:20:09,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:20:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-02 11:20:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:20:09,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:09,846 INFO L411 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-10-02 11:20:09,846 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 119264185, now seen corresponding path program 4 times [2019-10-02 11:20:09,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:09,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:09,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:20:10,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:10,078 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:20:10,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:20:10,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:20:10,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:10,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:20:10,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:10,196 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-10-02 11:20:10,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:10,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:10,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:10,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-02 11:20:10,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:20:10,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:10,561 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-10-02 11:20:10,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:10,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:10,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:10,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-02 11:20:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:20:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2019-10-02 11:20:10,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 11:20:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 11:20:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:20:10,638 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2019-10-02 11:20:13,549 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 11:20:15,597 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 11:20:17,627 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 11:20:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:17,673 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-02 11:20:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:20:17,674 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2019-10-02 11:20:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:17,676 INFO L225 Difference]: With dead ends: 68 [2019-10-02 11:20:17,676 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:20:17,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:20:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:20:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-10-02 11:20:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:20:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-10-02 11:20:17,687 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 36 [2019-10-02 11:20:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:17,687 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-10-02 11:20:17,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 11:20:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-10-02 11:20:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:20:17,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:17,689 INFO L411 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-10-02 11:20:17,689 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1605303374, now seen corresponding path program 5 times [2019-10-02 11:20:17,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:17,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:20:17,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:17,897 INFO L224 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-10-02 11:20:17,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:20:17,957 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 11:20:17,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:17,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:20:17,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:18,039 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-10-02 11:20:18,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:18,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:18,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:18,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 11:20:18,340 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-10-02 11:20:18,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:18,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:18,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:18,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:20:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:20:18,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-10-02 11:20:18,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:20:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:20:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:20:18,384 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 27 states. [2019-10-02 11:20:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:18,860 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-10-02 11:20:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:20:18,861 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2019-10-02 11:20:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:18,863 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:20:18,863 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:20:18,864 INFO L640 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-10-02 11:20:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:20:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-02 11:20:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 11:20:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-02 11:20:18,873 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2019-10-02 11:20:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:18,873 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-02 11:20:18,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:20:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-02 11:20:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:20:18,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:18,875 INFO L411 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-10-02 11:20:18,875 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash 921393797, now seen corresponding path program 6 times [2019-10-02 11:20:18,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:18,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:18,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:20:18,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:18,977 INFO L224 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-10-02 11:20:18,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:20:19,041 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:20:19,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:19,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:20:19,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:19,155 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-10-02 11:20:19,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:19,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-10-02 11:20:19,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:20:19,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:20:19,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:20:19,161 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2019-10-02 11:20:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:19,370 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-10-02 11:20:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:20:19,371 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-10-02 11:20:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:19,372 INFO L225 Difference]: With dead ends: 88 [2019-10-02 11:20:19,372 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:20:19,373 INFO L640 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-10-02 11:20:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:20:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-02 11:20:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 11:20:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-10-02 11:20:19,383 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2019-10-02 11:20:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:19,383 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-10-02 11:20:19,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:20:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-10-02 11:20:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:20:19,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:19,386 INFO L411 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-10-02 11:20:19,386 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash 288236131, now seen corresponding path program 7 times [2019-10-02 11:20:19,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:19,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:20:19,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:19,608 INFO L224 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-10-02 11:20:19,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:19,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:20:19,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:19,694 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-10-02 11:20:19,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:19,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:19,712 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-10-02 11:20:19,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 11:20:51,207 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-10-02 11:20:51,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:51,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:51,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:20:51,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 11:20:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:20:51,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:51,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-10-02 11:20:51,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:20:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:20:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=483, Unknown=4, NotChecked=0, Total=552 [2019-10-02 11:20:51,260 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-10-02 11:20:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:59,420 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-10-02 11:20:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:20:59,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-10-02 11:20:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:59,423 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:20:59,423 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:20:59,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=90, Invalid=662, Unknown=4, NotChecked=0, Total=756 [2019-10-02 11:20:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:20:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-02 11:20:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:20:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-10-02 11:20:59,434 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2019-10-02 11:20:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:59,434 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-10-02 11:20:59,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:20:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-10-02 11:20:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:20:59,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:59,436 INFO L411 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-10-02 11:20:59,436 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1266785178, now seen corresponding path program 8 times [2019-10-02 11:20:59,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:59,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:20:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:20:59,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:59,588 INFO L224 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-10-02 11:20:59,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:20:59,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:20:59,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:59,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:20:59,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:20:59,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:59,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-10-02 11:20:59,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 11:20:59,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 11:20:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:20:59,842 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 22 states. [2019-10-02 11:21:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:00,067 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-10-02 11:21:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:21:00,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-10-02 11:21:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:00,072 INFO L225 Difference]: With dead ends: 102 [2019-10-02 11:21:00,072 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:21:00,073 INFO L640 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-10-02 11:21:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:21:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-02 11:21:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 11:21:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-10-02 11:21:00,083 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2019-10-02 11:21:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:00,083 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-10-02 11:21:00,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 11:21:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-10-02 11:21:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:21:00,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:00,085 INFO L411 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-10-02 11:21:00,085 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526280, now seen corresponding path program 9 times [2019-10-02 11:21:00,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:00,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:21:00,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:00,374 INFO L224 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-10-02 11:21:00,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:21:00,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 11:21:00,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:00,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:21:00,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:00,556 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-10-02 11:21:00,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:00,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:00,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:00,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 11:21:01,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:01,717 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-10-02 11:21:01,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:21:01,737 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 11:21:01,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:01,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 11:21:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:21:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-10-02 11:21:01,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 11:21:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 11:21:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:21:01,815 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 37 states. [2019-10-02 11:21:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:09,590 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-10-02 11:21:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:21:09,590 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2019-10-02 11:21:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:09,591 INFO L225 Difference]: With dead ends: 122 [2019-10-02 11:21:09,591 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 11:21:09,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=435, Invalid=3987, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 11:21:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 11:21:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-10-02 11:21:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-02 11:21:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-10-02 11:21:09,604 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 66 [2019-10-02 11:21:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:09,605 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-10-02 11:21:09,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 11:21:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-10-02 11:21:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:21:09,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:09,606 INFO L411 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-10-02 11:21:09,607 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 138274573, now seen corresponding path program 10 times [2019-10-02 11:21:09,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:09,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 11:21:09,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:09,922 INFO L224 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-10-02 11:21:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:21:09,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:21:09,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:09,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 11:21:09,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:10,130 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-10-02 11:21:10,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:10,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:10,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:10,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 11:21:11,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:11,504 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-10-02 11:21:11,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:21:11,530 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 11:21:11,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:11,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 11:21:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 45 proven. 88 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:21:11,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:11,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2019-10-02 11:21:11,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 11:21:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 11:21:11,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:21:11,605 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-10-02 11:21:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:32,769 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-10-02 11:21:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 11:21:32,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-10-02 11:21:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:32,774 INFO L225 Difference]: With dead ends: 134 [2019-10-02 11:21:32,774 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:21:32,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=435, Invalid=4257, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 11:21:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:21:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2019-10-02 11:21:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 11:21:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-10-02 11:21:32,800 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 76 [2019-10-02 11:21:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:32,806 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-10-02 11:21:32,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 11:21:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-10-02 11:21:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:21:32,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:32,808 INFO L411 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-10-02 11:21:32,809 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1370929758, now seen corresponding path program 11 times [2019-10-02 11:21:32,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:32,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:32,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 11:21:33,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:33,222 INFO L224 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:21:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:21:33,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 11:21:33,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:33,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 11:21:33,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:33,554 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-10-02 11:21:33,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:33,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:33,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:33,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 11:21:34,395 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-10-02 11:21:34,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:34,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:34,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:21:34,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:21:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 11:21:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:34,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2019-10-02 11:21:34,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 11:21:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 11:21:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 11:21:34,497 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 43 states. [2019-10-02 11:21:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:35,633 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-10-02 11:21:35,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:21:35,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-10-02 11:21:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:35,635 INFO L225 Difference]: With dead ends: 102 [2019-10-02 11:21:35,635 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:21:35,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=2092, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 11:21:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:21:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-10-02 11:21:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 11:21:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-10-02 11:21:35,649 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2019-10-02 11:21:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:35,649 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-10-02 11:21:35,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 11:21:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-10-02 11:21:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:21:35,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:35,651 INFO L411 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-10-02 11:21:35,651 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1973489625, now seen corresponding path program 12 times [2019-10-02 11:21:35,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:35,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:35,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:35,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:35,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 11:21:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:35,861 INFO L224 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:21:35,892 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:21:35,956 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 11:21:35,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:35,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 11:21:35,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 11:21:36,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:36,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2019-10-02 11:21:36,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:21:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:21:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:21:36,195 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 31 states. [2019-10-02 11:21:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:36,573 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-10-02 11:21:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:21:36,575 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-10-02 11:21:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:36,577 INFO L225 Difference]: With dead ends: 144 [2019-10-02 11:21:36,577 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:21:36,578 INFO L640 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-10-02 11:21:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:21:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-10-02 11:21:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 11:21:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-10-02 11:21:36,590 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2019-10-02 11:21:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:36,590 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-10-02 11:21:36,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:21:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-10-02 11:21:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:21:36,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:36,591 INFO L411 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-10-02 11:21:36,592 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash -633986633, now seen corresponding path program 13 times [2019-10-02 11:21:36,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:36,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:36,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:36,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 11:21:36,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:36,947 INFO L224 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:21:36,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:37,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 11:21:37,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:37,052 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-10-02 11:21:37,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:37,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:37,058 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-10-02 11:21:37,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 11:23:36,848 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-10-02 11:23:36,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:23:36,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:23:36,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:23:36,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 11:23:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 11:23:36,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:36,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2019-10-02 11:23:36,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 11:23:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 11:23:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1151, Unknown=8, NotChecked=0, Total=1260 [2019-10-02 11:23:36,943 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 36 states. [2019-10-02 11:23:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:53,195 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-10-02 11:23:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:23:53,196 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 96 [2019-10-02 11:23:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:53,198 INFO L225 Difference]: With dead ends: 112 [2019-10-02 11:23:53,198 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:23:53,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 120.1s TimeCoverageRelationStatistics Valid=126, Invalid=1426, Unknown=8, NotChecked=0, Total=1560 [2019-10-02 11:23:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:23:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-10-02 11:23:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-02 11:23:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-10-02 11:23:53,209 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2019-10-02 11:23:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:53,210 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-10-02 11:23:53,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 11:23:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-10-02 11:23:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:23:53,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:53,211 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:23:53,211 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -292616466, now seen corresponding path program 14 times [2019-10-02 11:23:53,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:23:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 147 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 11:23:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:53,448 INFO L224 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-10-02 11:23:53,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:23:53,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:23:53,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:53,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:23:53,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 11:23:53,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:53,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2019-10-02 11:23:53,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 11:23:53,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 11:23:53,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 11:23:53,757 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 34 states. [2019-10-02 11:23:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:23:54,210 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2019-10-02 11:23:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:23:54,216 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2019-10-02 11:23:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:23:54,218 INFO L225 Difference]: With dead ends: 158 [2019-10-02 11:23:54,218 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:23:54,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:23:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:23:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-02 11:23:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-02 11:23:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-10-02 11:23:54,233 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2019-10-02 11:23:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:23:54,233 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-10-02 11:23:54,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 11:23:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-10-02 11:23:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 11:23:54,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:23:54,235 INFO L411 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-10-02 11:23:54,235 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:23:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:23:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1424630964, now seen corresponding path program 15 times [2019-10-02 11:23:54,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:23:54,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:23:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:54,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:23:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:23:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:23:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 11:23:54,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:23:54,851 INFO L224 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-10-02 11:23:54,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:23:55,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 11:23:55,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:23:55,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 11:23:55,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:23:55,264 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-10-02 11:23:55,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:23:55,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:23:55,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:23:55,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 11:23:57,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:23:57,664 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-10-02 11:23:57,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:23:57,678 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 11:23:57,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:23:57,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 11:23:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 127 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 11:23:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:23:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 53 [2019-10-02 11:23:57,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 11:23:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 11:23:57,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:23:57,791 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 53 states. [2019-10-02 11:24:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:05,035 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2019-10-02 11:24:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 11:24:05,035 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-10-02 11:24:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:05,037 INFO L225 Difference]: With dead ends: 170 [2019-10-02 11:24:05,037 INFO L226 Difference]: Without dead ends: 122 [2019-10-02 11:24:05,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 64 SyntacticMatches, 17 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=729, Invalid=7281, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 11:24:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-02 11:24:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-10-02 11:24:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-02 11:24:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-10-02 11:24:05,050 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 106 [2019-10-02 11:24:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:05,050 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-10-02 11:24:05,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 11:24:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-10-02 11:24:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:24:05,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:05,052 INFO L411 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-10-02 11:24:05,052 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1920871839, now seen corresponding path program 16 times [2019-10-02 11:24:05,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:05,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:05,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:05,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 11:24:05,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:05,549 INFO L224 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-10-02 11:24:05,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:24:05,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:24:05,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:05,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 11:24:05,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:05,756 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-10-02 11:24:05,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:05,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:05,761 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-10-02 11:24:05,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 11:25:53,983 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-10-02 11:25:53,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:53,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:25:53,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:25:53,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 11:25:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 11:25:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:25:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2019-10-02 11:25:54,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:25:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:25:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1593, Unknown=10, NotChecked=0, Total=1722 [2019-10-02 11:25:54,075 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 42 states. [2019-10-02 11:26:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:26:16,028 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2019-10-02 11:26:16,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:26:16,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 116 [2019-10-02 11:26:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:26:16,030 INFO L225 Difference]: With dead ends: 132 [2019-10-02 11:26:16,030 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 11:26:16,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 108.7s TimeCoverageRelationStatistics Valid=144, Invalid=1916, Unknown=10, NotChecked=0, Total=2070 [2019-10-02 11:26:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 11:26:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-10-02 11:26:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-02 11:26:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-10-02 11:26:16,043 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2019-10-02 11:26:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:26:16,044 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-10-02 11:26:16,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:26:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-10-02 11:26:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:26:16,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:26:16,045 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:26:16,046 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:26:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:26:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1466143336, now seen corresponding path program 17 times [2019-10-02 11:26:16,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:26:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:26:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:16,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:26:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:26:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 223 proven. 162 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 11:26:16,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:26:16,371 INFO L224 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-10-02 11:26:16,414 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:26:16,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-02 11:26:16,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:26:16,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 11:26:16,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:26:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 11:26:16,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:26:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2019-10-02 11:26:16,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 11:26:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 11:26:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1204, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:26:16,828 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 40 states. [2019-10-02 11:26:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:26:17,288 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2019-10-02 11:26:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:26:17,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2019-10-02 11:26:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:26:17,290 INFO L225 Difference]: With dead ends: 186 [2019-10-02 11:26:17,290 INFO L226 Difference]: Without dead ends: 130 [2019-10-02 11:26:17,292 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=620, Invalid=2136, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 11:26:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-02 11:26:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-02 11:26:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-02 11:26:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-10-02 11:26:17,308 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2019-10-02 11:26:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:26:17,308 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-10-02 11:26:17,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 11:26:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-10-02 11:26:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:26:17,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:26:17,310 INFO L411 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-10-02 11:26:17,310 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:26:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:26:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash 832268022, now seen corresponding path program 18 times [2019-10-02 11:26:17,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:26:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:26:17,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:17,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:26:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:26:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 11:26:18,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:26:18,063 INFO L224 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-10-02 11:26:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:26:18,258 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 11:26:18,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:26:18,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 11:26:18,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:26:18,603 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-10-02 11:26:18,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:26:18,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:26:18,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:26:18,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 11:26:25,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:26:25,106 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-10-02 11:26:25,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:26:25,122 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 11:26:25,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:26:25,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 11:26:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 261 proven. 177 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-02 11:26:25,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:26:25,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 63 [2019-10-02 11:26:25,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-02 11:26:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-02 11:26:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=3519, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 11:26:25,274 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 63 states. [2019-10-02 11:26:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:26:55,452 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-10-02 11:26:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-02 11:26:55,453 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2019-10-02 11:26:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:26:55,454 INFO L225 Difference]: With dead ends: 230 [2019-10-02 11:26:55,454 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 11:26:55,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 74 SyntacticMatches, 21 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4194 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1232, Invalid=15798, Unknown=0, NotChecked=0, Total=17030 [2019-10-02 11:26:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 11:26:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-10-02 11:26:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 11:26:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-10-02 11:26:55,467 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 126 [2019-10-02 11:26:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:26:55,467 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-10-02 11:26:55,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-02 11:26:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-10-02 11:26:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 11:26:55,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:26:55,468 INFO L411 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-10-02 11:26:55,469 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:26:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:26:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 17561867, now seen corresponding path program 19 times [2019-10-02 11:26:55,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:26:55,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:26:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:55,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:26:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:26:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 11:26:56,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:26:56,105 INFO L224 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-10-02 11:26:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:26:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:26:56,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-02 11:26:56,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:26:56,222 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-10-02 11:26:56,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:26:56,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:26:56,228 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-10-02 11:26:56,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 11:29:45,131 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-10-02 11:29:45,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:45,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:45,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:29:45,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-02 11:29:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 11:29:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 48 [2019-10-02 11:29:45,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 11:29:45,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 11:29:45,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2107, Unknown=12, NotChecked=0, Total=2256 [2019-10-02 11:29:45,248 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 48 states. [2019-10-02 11:30:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:10,338 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-10-02 11:30:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 11:30:10,341 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 136 [2019-10-02 11:30:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:10,343 INFO L225 Difference]: With dead ends: 152 [2019-10-02 11:30:10,343 INFO L226 Difference]: Without dead ends: 150 [2019-10-02 11:30:10,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 97 SyntacticMatches, 25 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 169.5s TimeCoverageRelationStatistics Valid=162, Invalid=2478, Unknown=12, NotChecked=0, Total=2652 [2019-10-02 11:30:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-02 11:30:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-10-02 11:30:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-02 11:30:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-10-02 11:30:10,358 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2019-10-02 11:30:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:10,358 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-10-02 11:30:10,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 11:30:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-10-02 11:30:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:30:10,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:10,360 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:30:10,360 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1877849534, now seen corresponding path program 20 times [2019-10-02 11:30:10,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:30:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 315 proven. 218 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 11:30:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:10,718 INFO L224 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-10-02 11:30:10,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:30:10,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:30:10,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:10,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 11:30:10,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 11:30:11,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:11,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2019-10-02 11:30:11,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 11:30:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 11:30:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1600, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 11:30:11,238 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 46 states. [2019-10-02 11:30:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:12,011 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2019-10-02 11:30:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:30:12,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2019-10-02 11:30:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:12,013 INFO L225 Difference]: With dead ends: 214 [2019-10-02 11:30:12,013 INFO L226 Difference]: Without dead ends: 150 [2019-10-02 11:30:12,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=819, Invalid=2841, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 11:30:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-02 11:30:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-02 11:30:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-02 11:30:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-10-02 11:30:12,042 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2019-10-02 11:30:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:12,043 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-10-02 11:30:12,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 11:30:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-10-02 11:30:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 11:30:12,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:12,044 INFO L411 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-10-02 11:30:12,044 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 352643232, now seen corresponding path program 21 times [2019-10-02 11:30:12,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:12,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:30:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 11:30:12,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:12,927 INFO L224 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-10-02 11:30:12,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:30:13,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-02 11:30:13,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:13,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 11:30:13,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:13,669 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-10-02 11:30:13,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:13,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:13,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 11:30:19,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:19,709 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-10-02 11:30:19,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 11:30:19,726 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 11:30:19,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:19,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 11:30:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 357 proven. 235 refuted. 56 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-02 11:30:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:19,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 70 [2019-10-02 11:30:19,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-02 11:30:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-02 11:30:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=4314, Unknown=1, NotChecked=0, Total=4830 [2019-10-02 11:30:19,893 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 70 states. [2019-10-02 11:30:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:56,304 INFO L93 Difference]: Finished difference Result 246 states and 258 transitions. [2019-10-02 11:30:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 11:30:56,304 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 146 [2019-10-02 11:30:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:56,306 INFO L225 Difference]: With dead ends: 246 [2019-10-02 11:30:56,306 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 11:30:56,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 88 SyntacticMatches, 24 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1332, Invalid=15959, Unknown=1, NotChecked=0, Total=17292 [2019-10-02 11:30:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 11:30:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2019-10-02 11:30:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-02 11:30:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-10-02 11:30:56,328 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 146 [2019-10-02 11:30:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:56,329 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-10-02 11:30:56,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-02 11:30:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-10-02 11:30:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:30:56,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:56,330 INFO L411 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-10-02 11:30:56,330 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1405119051, now seen corresponding path program 22 times [2019-10-02 11:30:56,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:56,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:30:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-02 11:30:57,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:57,138 INFO L224 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-10-02 11:30:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:30:57,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:30:57,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:57,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 11:30:57,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:57,927 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-10-02 11:30:57,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:57,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:57,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:30:57,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-02 11:31:02,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:31:02,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:02,775 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-10-02 11:31:02,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:02,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:02,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:02,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-10-02 11:31:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 378 proven. 267 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-02 11:31:02,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 73 [2019-10-02 11:31:02,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-02 11:31:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-02 11:31:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4862, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 11:31:02,976 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 73 states. [2019-10-02 11:31:11,041 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:13,139 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:14,972 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:15,432 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:16,875 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:18,968 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:21,166 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:23,272 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:25,369 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:27,468 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:29,573 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:31:31,670 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 11:31:33,765 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 11:31:35,822 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 11:31:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:35,909 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2019-10-02 11:31:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 11:31:35,909 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 156 [2019-10-02 11:31:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:35,911 INFO L225 Difference]: With dead ends: 236 [2019-10-02 11:31:35,911 INFO L226 Difference]: Without dead ends: 172 [2019-10-02 11:31:35,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 94 SyntacticMatches, 27 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4757 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=1271, Invalid=18469, Unknown=0, NotChecked=0, Total=19740 [2019-10-02 11:31:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-02 11:31:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2019-10-02 11:31:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-02 11:31:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-10-02 11:31:35,932 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 156 [2019-10-02 11:31:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:35,932 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-10-02 11:31:35,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-02 11:31:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-10-02 11:31:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:31:35,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:35,934 INFO L411 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-10-02 11:31:35,934 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 553476170, now seen corresponding path program 23 times [2019-10-02 11:31:35,934 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:35,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:35,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 30 proven. 706 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-02 11:31:36,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:36,794 INFO L224 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-10-02 11:31:36,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:31:37,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-02 11:31:37,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:37,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-02 11:31:37,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:37,838 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-10-02 11:31:37,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:37,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:37,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:37,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 11:31:40,486 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-10-02 11:31:40,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:40,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:40,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:40,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:31:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-02 11:31:40,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:40,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 75 [2019-10-02 11:31:40,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-02 11:31:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-02 11:31:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=5316, Unknown=0, NotChecked=0, Total=5550 [2019-10-02 11:31:40,652 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 75 states. [2019-10-02 11:31:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:44,105 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2019-10-02 11:31:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 11:31:44,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 166 [2019-10-02 11:31:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:44,108 INFO L225 Difference]: With dead ends: 182 [2019-10-02 11:31:44,108 INFO L226 Difference]: Without dead ends: 180 [2019-10-02 11:31:44,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 102 SyntacticMatches, 29 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=268, Invalid=6052, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 11:31:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-02 11:31:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-10-02 11:31:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-02 11:31:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-10-02 11:31:44,124 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 166 [2019-10-02 11:31:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:44,125 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-10-02 11:31:44,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-02 11:31:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-10-02 11:31:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:31:44,126 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:44,126 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:31:44,126 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash 881066625, now seen corresponding path program 24 times [2019-10-02 11:31:44,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:44,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:44,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 483 proven. 317 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-02 11:31:44,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:44,650 INFO L224 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-10-02 11:31:44,719 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:31:45,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 11:31:45,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:45,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 11:31:45,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 544 proven. 256 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-02 11:31:45,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:45,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2019-10-02 11:31:45,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 11:31:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 11:31:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=2299, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 11:31:45,588 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 55 states. [2019-10-02 11:31:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:46,805 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2019-10-02 11:31:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 11:31:46,805 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 174 [2019-10-02 11:31:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:46,808 INFO L225 Difference]: With dead ends: 256 [2019-10-02 11:31:46,808 INFO L226 Difference]: Without dead ends: 180 [2019-10-02 11:31:46,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1170, Invalid=4086, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 11:31:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-02 11:31:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-10-02 11:31:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-02 11:31:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-10-02 11:31:46,846 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2019-10-02 11:31:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:46,846 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-10-02 11:31:46,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 11:31:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-10-02 11:31:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 11:31:46,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:46,847 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:31:46,848 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1594337375, now seen corresponding path program 25 times [2019-10-02 11:31:46,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:46,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:46,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 32 proven. 801 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-02 11:31:47,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:47,818 INFO L224 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-10-02 11:31:47,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:31:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:47,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-02 11:31:47,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:47,957 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-10-02 11:31:47,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:47,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:47,963 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-10-02 11:31:47,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18