/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 22:13:48,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 22:13:48,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 22:13:48,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 22:13:48,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 22:13:48,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 22:13:48,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 22:13:48,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 22:13:48,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 22:13:48,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 22:13:48,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 22:13:48,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 22:13:48,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 22:13:48,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 22:13:48,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 22:13:48,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 22:13:48,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 22:13:48,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 22:13:48,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 22:13:48,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 22:13:48,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 22:13:48,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 22:13:48,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 22:13:48,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 22:13:48,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 22:13:48,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 22:13:48,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 22:13:48,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 22:13:48,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 22:13:48,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 22:13:48,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 22:13:48,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 22:13:48,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 22:13:48,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 22:13:48,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 22:13:48,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 22:13:48,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 22:13:48,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 22:13:48,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 22:13:48,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 22:13:48,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 22:13:48,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 22:13:48,501 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 22:13:48,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 22:13:48,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 22:13:48,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 22:13:48,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 22:13:48,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 22:13:48,505 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 22:13:48,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 22:13:48,505 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 22:13:48,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 22:13:48,506 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 22:13:48,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 22:13:48,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 22:13:48,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 22:13:48,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 22:13:48,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 22:13:48,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 22:13:48,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 22:13:48,816 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 22:13:48,818 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 22:13:48,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl [2021-06-05 22:13:48,819 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl' [2021-06-05 22:13:48,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 22:13:48,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 22:13:48,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 22:13:48,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 22:13:48,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 22:13:48,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 22:13:48,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 22:13:48,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 22:13:48,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 22:13:48,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/1) ... [2021-06-05 22:13:48,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 22:13:48,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 22:13:48,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 22:13:48,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 22:13:48,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (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 [2021-06-05 22:13:48,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 22:13:48,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 22:13:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 22:13:48,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 22:13:48,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 22:13:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 22:13:48,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 22:13:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 22:13:48,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 22:13:48,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 22:13:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 22:13:48,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 22:13:48,975 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 22:13:49,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 22:13:49,410 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 22:13:49,411 INFO L202 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:13:49 BoogieIcfgContainer [2021-06-05 22:13:49,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 22:13:49,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 22:13:49,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 22:13:49,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 22:13:49,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 10:13:48" (1/2) ... [2021-06-05 22:13:49,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60db349d and model type word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:13:49, skipping insertion in model container [2021-06-05 22:13:49,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:13:49" (2/2) ... [2021-06-05 22:13:49,417 INFO L111 eAbstractionObserver]: Analyzing ICFG word-subst.wvr.bpl [2021-06-05 22:13:49,425 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 22:13:49,425 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 22:13:49,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 22:13:49,426 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 22:13:49,469 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 22:13:49,487 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 22:13:49,502 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 22:13:49,503 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 22:13:49,503 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 22:13:49,503 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 22:13:49,503 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 22:13:49,503 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 22:13:49,503 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 22:13:49,503 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 22:13:49,511 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 28 transitions, 80 flow [2021-06-05 22:13:49,527 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (376), 109 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (376), 109 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 22:13:49,537 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:49,537 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:49,538 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash -200100504, now seen corresponding path program 1 times [2021-06-05 22:13:49,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:49,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787215049] [2021-06-05 22:13:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:49,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:49,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787215049] [2021-06-05 22:13:49,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787215049] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:49,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:49,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:49,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965741113] [2021-06-05 22:13:49,710 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:49,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:49,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:49,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:49,723 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (376), 109 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:49,765 INFO L93 Difference]: Finished difference Result 171 states and 561 transitions. [2021-06-05 22:13:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 22:13:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 22:13:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:49,775 INFO L225 Difference]: With dead ends: 171 [2021-06-05 22:13:49,775 INFO L226 Difference]: Without dead ends: 108 [2021-06-05 22:13:49,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-06-05 22:13:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-06-05 22:13:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.2990654205607477) internal successors, (353), 107 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 353 transitions. [2021-06-05 22:13:49,815 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 353 transitions. Word has length 14 [2021-06-05 22:13:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:49,816 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 353 transitions. [2021-06-05 22:13:49,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 353 transitions. [2021-06-05 22:13:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:49,818 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:49,818 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:49,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 22:13:49,818 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash -294876135, now seen corresponding path program 1 times [2021-06-05 22:13:49,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:49,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037939926] [2021-06-05 22:13:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:49,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:49,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037939926] [2021-06-05 22:13:49,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037939926] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:49,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:49,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:49,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603258257] [2021-06-05 22:13:49,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:49,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:49,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:49,898 INFO L87 Difference]: Start difference. First operand 108 states and 353 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:49,987 INFO L93 Difference]: Finished difference Result 172 states and 504 transitions. [2021-06-05 22:13:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:49,990 INFO L225 Difference]: With dead ends: 172 [2021-06-05 22:13:49,990 INFO L226 Difference]: Without dead ends: 153 [2021-06-05 22:13:49,991 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-06-05 22:13:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-06-05 22:13:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 3.19672131147541) internal successors, (390), 122 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 390 transitions. [2021-06-05 22:13:50,006 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 390 transitions. Word has length 15 [2021-06-05 22:13:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:50,007 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 390 transitions. [2021-06-05 22:13:50,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 390 transitions. [2021-06-05 22:13:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:50,009 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:50,009 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:50,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 22:13:50,009 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash -487883073, now seen corresponding path program 2 times [2021-06-05 22:13:50,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:50,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220836906] [2021-06-05 22:13:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:50,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:50,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220836906] [2021-06-05 22:13:50,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220836906] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:50,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:50,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:50,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176666333] [2021-06-05 22:13:50,077 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:50,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:50,078 INFO L87 Difference]: Start difference. First operand 123 states and 390 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:50,184 INFO L93 Difference]: Finished difference Result 179 states and 520 transitions. [2021-06-05 22:13:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:50,189 INFO L225 Difference]: With dead ends: 179 [2021-06-05 22:13:50,192 INFO L226 Difference]: Without dead ends: 160 [2021-06-05 22:13:50,192 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-06-05 22:13:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2021-06-05 22:13:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 3.1538461538461537) internal successors, (410), 130 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 410 transitions. [2021-06-05 22:13:50,207 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 410 transitions. Word has length 15 [2021-06-05 22:13:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:50,207 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 410 transitions. [2021-06-05 22:13:50,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 410 transitions. [2021-06-05 22:13:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:50,210 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:50,210 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:50,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 22:13:50,211 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 372369077, now seen corresponding path program 3 times [2021-06-05 22:13:50,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:50,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283435226] [2021-06-05 22:13:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:50,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:50,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283435226] [2021-06-05 22:13:50,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283435226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:50,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:50,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:50,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377164475] [2021-06-05 22:13:50,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:50,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:50,339 INFO L87 Difference]: Start difference. First operand 131 states and 410 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:50,423 INFO L93 Difference]: Finished difference Result 235 states and 657 transitions. [2021-06-05 22:13:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:50,425 INFO L225 Difference]: With dead ends: 235 [2021-06-05 22:13:50,425 INFO L226 Difference]: Without dead ends: 216 [2021-06-05 22:13:50,425 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-06-05 22:13:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2021-06-05 22:13:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.1492537313432836) internal successors, (422), 134 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 422 transitions. [2021-06-05 22:13:50,436 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 422 transitions. Word has length 15 [2021-06-05 22:13:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:50,436 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 422 transitions. [2021-06-05 22:13:50,436 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 422 transitions. [2021-06-05 22:13:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:50,438 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:50,438 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:50,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 22:13:50,438 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:50,439 INFO L82 PathProgramCache]: Analyzing trace with hash 384286855, now seen corresponding path program 4 times [2021-06-05 22:13:50,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:50,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580976463] [2021-06-05 22:13:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:50,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:50,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580976463] [2021-06-05 22:13:50,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580976463] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:50,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:50,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:50,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677735389] [2021-06-05 22:13:50,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:50,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:50,537 INFO L87 Difference]: Start difference. First operand 135 states and 422 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:50,614 INFO L93 Difference]: Finished difference Result 194 states and 550 transitions. [2021-06-05 22:13:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:50,616 INFO L225 Difference]: With dead ends: 194 [2021-06-05 22:13:50,616 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 22:13:50,617 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 22:13:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2021-06-05 22:13:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.1343283582089554) internal successors, (420), 134 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 420 transitions. [2021-06-05 22:13:50,633 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 420 transitions. Word has length 15 [2021-06-05 22:13:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:50,634 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 420 transitions. [2021-06-05 22:13:50,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 420 transitions. [2021-06-05 22:13:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:50,637 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:50,637 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:50,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 22:13:50,638 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1046340473, now seen corresponding path program 5 times [2021-06-05 22:13:50,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:50,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598002010] [2021-06-05 22:13:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:50,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:50,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598002010] [2021-06-05 22:13:50,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598002010] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:50,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:50,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:50,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162514613] [2021-06-05 22:13:50,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:50,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:50,766 INFO L87 Difference]: Start difference. First operand 135 states and 420 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:50,849 INFO L93 Difference]: Finished difference Result 228 states and 638 transitions. [2021-06-05 22:13:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:50,852 INFO L225 Difference]: With dead ends: 228 [2021-06-05 22:13:50,852 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 22:13:50,852 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 22:13:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2021-06-05 22:13:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.139705882352941) internal successors, (427), 136 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 427 transitions. [2021-06-05 22:13:50,860 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 427 transitions. Word has length 15 [2021-06-05 22:13:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:50,863 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 427 transitions. [2021-06-05 22:13:50,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 427 transitions. [2021-06-05 22:13:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 22:13:50,868 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:50,868 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:50,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 22:13:50,869 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -964122021, now seen corresponding path program 6 times [2021-06-05 22:13:50,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:50,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970757662] [2021-06-05 22:13:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:50,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:50,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970757662] [2021-06-05 22:13:50,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970757662] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:50,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:50,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 22:13:50,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258295429] [2021-06-05 22:13:50,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 22:13:50,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 22:13:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:50,990 INFO L87 Difference]: Start difference. First operand 137 states and 427 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,064 INFO L93 Difference]: Finished difference Result 195 states and 552 transitions. [2021-06-05 22:13:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:51,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 22:13:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,066 INFO L225 Difference]: With dead ends: 195 [2021-06-05 22:13:51,066 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 22:13:51,066 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:13:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 22:13:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2021-06-05 22:13:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.125) internal successors, (425), 136 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 425 transitions. [2021-06-05 22:13:51,072 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 425 transitions. Word has length 15 [2021-06-05 22:13:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,072 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 425 transitions. [2021-06-05 22:13:51,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 425 transitions. [2021-06-05 22:13:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,073 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,073 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,074 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 22:13:51,074 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -570116437, now seen corresponding path program 1 times [2021-06-05 22:13:51,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154421077] [2021-06-05 22:13:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154421077] [2021-06-05 22:13:51,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154421077] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678676016] [2021-06-05 22:13:51,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,119 INFO L87 Difference]: Start difference. First operand 137 states and 425 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,150 INFO L93 Difference]: Finished difference Result 203 states and 586 transitions. [2021-06-05 22:13:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,153 INFO L225 Difference]: With dead ends: 203 [2021-06-05 22:13:51,153 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 22:13:51,153 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 22:13:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2021-06-05 22:13:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.1185185185185187) internal successors, (421), 135 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 421 transitions. [2021-06-05 22:13:51,159 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 421 transitions. Word has length 16 [2021-06-05 22:13:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,159 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 421 transitions. [2021-06-05 22:13:51,159 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 421 transitions. [2021-06-05 22:13:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,160 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,160 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 22:13:51,160 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash -581930556, now seen corresponding path program 1 times [2021-06-05 22:13:51,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233435823] [2021-06-05 22:13:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,179 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233435823] [2021-06-05 22:13:51,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233435823] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760998384] [2021-06-05 22:13:51,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,180 INFO L87 Difference]: Start difference. First operand 136 states and 421 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,210 INFO L93 Difference]: Finished difference Result 194 states and 542 transitions. [2021-06-05 22:13:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,212 INFO L225 Difference]: With dead ends: 194 [2021-06-05 22:13:51,212 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 22:13:51,214 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 22:13:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2021-06-05 22:13:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.022222222222222) internal successors, (408), 135 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 408 transitions. [2021-06-05 22:13:51,220 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 408 transitions. Word has length 16 [2021-06-05 22:13:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,221 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 408 transitions. [2021-06-05 22:13:51,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 408 transitions. [2021-06-05 22:13:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,222 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,222 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 22:13:51,222 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1420564495, now seen corresponding path program 2 times [2021-06-05 22:13:51,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343894849] [2021-06-05 22:13:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343894849] [2021-06-05 22:13:51,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343894849] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794305139] [2021-06-05 22:13:51,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,248 INFO L87 Difference]: Start difference. First operand 136 states and 408 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,280 INFO L93 Difference]: Finished difference Result 205 states and 567 transitions. [2021-06-05 22:13:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,282 INFO L225 Difference]: With dead ends: 205 [2021-06-05 22:13:51,282 INFO L226 Difference]: Without dead ends: 205 [2021-06-05 22:13:51,282 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-06-05 22:13:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 114. [2021-06-05 22:13:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.920353982300885) internal successors, (330), 113 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 330 transitions. [2021-06-05 22:13:51,287 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 330 transitions. Word has length 16 [2021-06-05 22:13:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,288 INFO L482 AbstractCegarLoop]: Abstraction has 114 states and 330 transitions. [2021-06-05 22:13:51,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 330 transitions. [2021-06-05 22:13:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,289 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,289 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 22:13:51,289 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1521275701, now seen corresponding path program 3 times [2021-06-05 22:13:51,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188903021] [2021-06-05 22:13:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188903021] [2021-06-05 22:13:51,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188903021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359450828] [2021-06-05 22:13:51,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,315 INFO L87 Difference]: Start difference. First operand 114 states and 330 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,332 INFO L93 Difference]: Finished difference Result 171 states and 460 transitions. [2021-06-05 22:13:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:13:51,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,333 INFO L225 Difference]: With dead ends: 171 [2021-06-05 22:13:51,334 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 22:13:51,334 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 22:13:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2021-06-05 22:13:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.908256880733945) internal successors, (317), 109 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 317 transitions. [2021-06-05 22:13:51,338 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 317 transitions. Word has length 16 [2021-06-05 22:13:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,339 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 317 transitions. [2021-06-05 22:13:51,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 317 transitions. [2021-06-05 22:13:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,339 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,340 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 22:13:51,340 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1372165464, now seen corresponding path program 2 times [2021-06-05 22:13:51,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355747169] [2021-06-05 22:13:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355747169] [2021-06-05 22:13:51,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355747169] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112039406] [2021-06-05 22:13:51,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,358 INFO L87 Difference]: Start difference. First operand 110 states and 317 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,376 INFO L93 Difference]: Finished difference Result 179 states and 482 transitions. [2021-06-05 22:13:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 22:13:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,377 INFO L225 Difference]: With dead ends: 179 [2021-06-05 22:13:51,377 INFO L226 Difference]: Without dead ends: 164 [2021-06-05 22:13:51,378 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-06-05 22:13:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2021-06-05 22:13:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.8584070796460175) internal successors, (323), 113 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 323 transitions. [2021-06-05 22:13:51,382 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 323 transitions. Word has length 16 [2021-06-05 22:13:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,382 INFO L482 AbstractCegarLoop]: Abstraction has 114 states and 323 transitions. [2021-06-05 22:13:51,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 323 transitions. [2021-06-05 22:13:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,383 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,383 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 22:13:51,383 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash -507426732, now seen corresponding path program 3 times [2021-06-05 22:13:51,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704811875] [2021-06-05 22:13:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704811875] [2021-06-05 22:13:51,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704811875] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275802565] [2021-06-05 22:13:51,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,400 INFO L87 Difference]: Start difference. First operand 114 states and 323 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,416 INFO L93 Difference]: Finished difference Result 156 states and 416 transitions. [2021-06-05 22:13:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:13:51,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,417 INFO L225 Difference]: With dead ends: 156 [2021-06-05 22:13:51,417 INFO L226 Difference]: Without dead ends: 146 [2021-06-05 22:13:51,418 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-06-05 22:13:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2021-06-05 22:13:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.889908256880734) internal successors, (315), 109 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 315 transitions. [2021-06-05 22:13:51,439 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 315 transitions. Word has length 16 [2021-06-05 22:13:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,440 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 315 transitions. [2021-06-05 22:13:51,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 315 transitions. [2021-06-05 22:13:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,440 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,440 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 22:13:51,441 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1294148210, now seen corresponding path program 4 times [2021-06-05 22:13:51,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352492243] [2021-06-05 22:13:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352492243] [2021-06-05 22:13:51,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352492243] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176910800] [2021-06-05 22:13:51,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,456 INFO L87 Difference]: Start difference. First operand 110 states and 315 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,471 INFO L93 Difference]: Finished difference Result 151 states and 405 transitions. [2021-06-05 22:13:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:13:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,472 INFO L225 Difference]: With dead ends: 151 [2021-06-05 22:13:51,472 INFO L226 Difference]: Without dead ends: 145 [2021-06-05 22:13:51,472 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-06-05 22:13:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2021-06-05 22:13:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.8623853211009176) internal successors, (312), 109 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 312 transitions. [2021-06-05 22:13:51,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 312 transitions. Word has length 16 [2021-06-05 22:13:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,476 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 312 transitions. [2021-06-05 22:13:51,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 312 transitions. [2021-06-05 22:13:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 22:13:51,477 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,477 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 22:13:51,477 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1904685263, now seen corresponding path program 4 times [2021-06-05 22:13:51,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873315857] [2021-06-05 22:13:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873315857] [2021-06-05 22:13:51,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873315857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 22:13:51,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092679634] [2021-06-05 22:13:51,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 22:13:51,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 22:13:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 22:13:51,491 INFO L87 Difference]: Start difference. First operand 110 states and 312 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,503 INFO L93 Difference]: Finished difference Result 116 states and 321 transitions. [2021-06-05 22:13:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 22:13:51,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 22:13:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,504 INFO L225 Difference]: With dead ends: 116 [2021-06-05 22:13:51,504 INFO L226 Difference]: Without dead ends: 108 [2021-06-05 22:13:51,504 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 22:13:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-06-05 22:13:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-06-05 22:13:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.878504672897196) internal successors, (308), 107 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 308 transitions. [2021-06-05 22:13:51,507 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 308 transitions. Word has length 16 [2021-06-05 22:13:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,507 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 308 transitions. [2021-06-05 22:13:51,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 308 transitions. [2021-06-05 22:13:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:51,508 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,508 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 22:13:51,508 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash -524445326, now seen corresponding path program 1 times [2021-06-05 22:13:51,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228395053] [2021-06-05 22:13:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228395053] [2021-06-05 22:13:51,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228395053] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:51,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8363697] [2021-06-05 22:13:51,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:51,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:51,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:51,583 INFO L87 Difference]: Start difference. First operand 108 states and 308 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:51,733 INFO L93 Difference]: Finished difference Result 265 states and 721 transitions. [2021-06-05 22:13:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:51,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:51,735 INFO L225 Difference]: With dead ends: 265 [2021-06-05 22:13:51,735 INFO L226 Difference]: Without dead ends: 250 [2021-06-05 22:13:51,735 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 142.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-06-05 22:13:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 141. [2021-06-05 22:13:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.7928571428571427) internal successors, (391), 140 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 391 transitions. [2021-06-05 22:13:51,741 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 391 transitions. Word has length 17 [2021-06-05 22:13:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:51,741 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 391 transitions. [2021-06-05 22:13:51,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 391 transitions. [2021-06-05 22:13:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:51,742 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:51,742 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:51,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 22:13:51,742 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 683107746, now seen corresponding path program 2 times [2021-06-05 22:13:51,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:51,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609109437] [2021-06-05 22:13:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:51,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:51,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609109437] [2021-06-05 22:13:51,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609109437] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:51,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:51,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:51,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720615146] [2021-06-05 22:13:51,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:51,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:51,827 INFO L87 Difference]: Start difference. First operand 141 states and 391 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:52,037 INFO L93 Difference]: Finished difference Result 298 states and 795 transitions. [2021-06-05 22:13:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:52,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:52,039 INFO L225 Difference]: With dead ends: 298 [2021-06-05 22:13:52,039 INFO L226 Difference]: Without dead ends: 283 [2021-06-05 22:13:52,039 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 196.8ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-06-05 22:13:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 150. [2021-06-05 22:13:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.8053691275167787) internal successors, (418), 149 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2021-06-05 22:13:52,045 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 17 [2021-06-05 22:13:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:52,045 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2021-06-05 22:13:52,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2021-06-05 22:13:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:52,046 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:52,046 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:52,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 22:13:52,046 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1015612642, now seen corresponding path program 3 times [2021-06-05 22:13:52,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:52,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94697583] [2021-06-05 22:13:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:52,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:52,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94697583] [2021-06-05 22:13:52,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94697583] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:52,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:52,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:52,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211666288] [2021-06-05 22:13:52,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:52,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:52,134 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:52,339 INFO L93 Difference]: Finished difference Result 281 states and 763 transitions. [2021-06-05 22:13:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:52,341 INFO L225 Difference]: With dead ends: 281 [2021-06-05 22:13:52,341 INFO L226 Difference]: Without dead ends: 266 [2021-06-05 22:13:52,342 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 194.3ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-06-05 22:13:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 150. [2021-06-05 22:13:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.8053691275167787) internal successors, (418), 149 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2021-06-05 22:13:52,347 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 17 [2021-06-05 22:13:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:52,347 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2021-06-05 22:13:52,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2021-06-05 22:13:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:52,348 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:52,348 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:52,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 22:13:52,348 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 173653428, now seen corresponding path program 4 times [2021-06-05 22:13:52,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:52,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50268192] [2021-06-05 22:13:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:52,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:52,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50268192] [2021-06-05 22:13:52,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50268192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:52,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:52,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:52,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810857857] [2021-06-05 22:13:52,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:52,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:52,418 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:52,619 INFO L93 Difference]: Finished difference Result 289 states and 784 transitions. [2021-06-05 22:13:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:52,622 INFO L225 Difference]: With dead ends: 289 [2021-06-05 22:13:52,622 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 22:13:52,622 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 164.7ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 22:13:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 159. [2021-06-05 22:13:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.7974683544303796) internal successors, (442), 158 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 442 transitions. [2021-06-05 22:13:52,628 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 442 transitions. Word has length 17 [2021-06-05 22:13:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:52,628 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 442 transitions. [2021-06-05 22:13:52,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 442 transitions. [2021-06-05 22:13:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:52,629 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:52,629 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:52,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 22:13:52,630 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 147877944, now seen corresponding path program 5 times [2021-06-05 22:13:52,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:52,630 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504064488] [2021-06-05 22:13:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:52,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:52,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504064488] [2021-06-05 22:13:52,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504064488] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:52,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:52,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:52,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455587448] [2021-06-05 22:13:52,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:52,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:52,713 INFO L87 Difference]: Start difference. First operand 159 states and 442 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:52,929 INFO L93 Difference]: Finished difference Result 322 states and 859 transitions. [2021-06-05 22:13:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:52,931 INFO L225 Difference]: With dead ends: 322 [2021-06-05 22:13:52,931 INFO L226 Difference]: Without dead ends: 307 [2021-06-05 22:13:52,931 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-06-05 22:13:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 162. [2021-06-05 22:13:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.8322981366459627) internal successors, (456), 161 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 456 transitions. [2021-06-05 22:13:52,937 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 456 transitions. Word has length 17 [2021-06-05 22:13:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:52,938 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 456 transitions. [2021-06-05 22:13:52,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 456 transitions. [2021-06-05 22:13:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:52,938 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:52,938 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:52,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 22:13:52,938 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1550842444, now seen corresponding path program 6 times [2021-06-05 22:13:52,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:52,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893410329] [2021-06-05 22:13:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:53,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:53,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893410329] [2021-06-05 22:13:53,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893410329] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:53,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:53,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:53,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570565480] [2021-06-05 22:13:53,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:53,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:53,038 INFO L87 Difference]: Start difference. First operand 162 states and 456 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:53,245 INFO L93 Difference]: Finished difference Result 299 states and 814 transitions. [2021-06-05 22:13:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:53,246 INFO L225 Difference]: With dead ends: 299 [2021-06-05 22:13:53,246 INFO L226 Difference]: Without dead ends: 284 [2021-06-05 22:13:53,247 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 188.8ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:13:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-06-05 22:13:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 159. [2021-06-05 22:13:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.7974683544303796) internal successors, (442), 158 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 442 transitions. [2021-06-05 22:13:53,252 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 442 transitions. Word has length 17 [2021-06-05 22:13:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:53,252 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 442 transitions. [2021-06-05 22:13:53,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 442 transitions. [2021-06-05 22:13:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:53,252 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:53,252 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:53,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 22:13:53,253 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2035892590, now seen corresponding path program 7 times [2021-06-05 22:13:53,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:53,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262919114] [2021-06-05 22:13:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:53,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:53,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262919114] [2021-06-05 22:13:53,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262919114] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:53,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:53,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:53,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093343535] [2021-06-05 22:13:53,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:53,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:53,320 INFO L87 Difference]: Start difference. First operand 159 states and 442 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:53,509 INFO L93 Difference]: Finished difference Result 389 states and 1040 transitions. [2021-06-05 22:13:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:53,511 INFO L225 Difference]: With dead ends: 389 [2021-06-05 22:13:53,511 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 22:13:53,512 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 174.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 22:13:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 166. [2021-06-05 22:13:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.8484848484848486) internal successors, (470), 165 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 470 transitions. [2021-06-05 22:13:53,517 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 470 transitions. Word has length 17 [2021-06-05 22:13:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:53,518 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 470 transitions. [2021-06-05 22:13:53,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 470 transitions. [2021-06-05 22:13:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:53,518 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:53,518 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:53,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 22:13:53,518 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -828339518, now seen corresponding path program 8 times [2021-06-05 22:13:53,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:53,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574844662] [2021-06-05 22:13:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:53,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:53,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574844662] [2021-06-05 22:13:53,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574844662] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:53,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:53,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:53,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866631870] [2021-06-05 22:13:53,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:53,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:53,589 INFO L87 Difference]: Start difference. First operand 166 states and 470 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:53,822 INFO L93 Difference]: Finished difference Result 398 states and 1066 transitions. [2021-06-05 22:13:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:53,824 INFO L225 Difference]: With dead ends: 398 [2021-06-05 22:13:53,824 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 22:13:53,824 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 211.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 22:13:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 169. [2021-06-05 22:13:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.880952380952381) internal successors, (484), 168 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 484 transitions. [2021-06-05 22:13:53,829 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 484 transitions. Word has length 17 [2021-06-05 22:13:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:53,829 INFO L482 AbstractCegarLoop]: Abstraction has 169 states and 484 transitions. [2021-06-05 22:13:53,830 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 484 transitions. [2021-06-05 22:13:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:53,830 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:53,830 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:53,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 22:13:53,830 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1767907390, now seen corresponding path program 9 times [2021-06-05 22:13:53,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:53,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912804425] [2021-06-05 22:13:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:53,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:53,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912804425] [2021-06-05 22:13:53,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912804425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:53,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:53,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:53,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906087956] [2021-06-05 22:13:53,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:53,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:53,909 INFO L87 Difference]: Start difference. First operand 169 states and 484 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:54,126 INFO L93 Difference]: Finished difference Result 405 states and 1082 transitions. [2021-06-05 22:13:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:54,128 INFO L225 Difference]: With dead ends: 405 [2021-06-05 22:13:54,128 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 22:13:54,129 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 205.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 22:13:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 161. [2021-06-05 22:13:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.825) internal successors, (452), 160 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 452 transitions. [2021-06-05 22:13:54,136 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 452 transitions. Word has length 17 [2021-06-05 22:13:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:54,136 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 452 transitions. [2021-06-05 22:13:54,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 452 transitions. [2021-06-05 22:13:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:54,137 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:54,137 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:54,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 22:13:54,137 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1043349262, now seen corresponding path program 10 times [2021-06-05 22:13:54,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:54,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875506751] [2021-06-05 22:13:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:54,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:54,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875506751] [2021-06-05 22:13:54,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875506751] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:54,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:54,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:54,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659140000] [2021-06-05 22:13:54,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:54,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:54,216 INFO L87 Difference]: Start difference. First operand 161 states and 452 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:54,325 INFO L93 Difference]: Finished difference Result 340 states and 918 transitions. [2021-06-05 22:13:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:54,327 INFO L225 Difference]: With dead ends: 340 [2021-06-05 22:13:54,327 INFO L226 Difference]: Without dead ends: 325 [2021-06-05 22:13:54,328 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 94.6ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-06-05 22:13:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 165. [2021-06-05 22:13:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.841463414634146) internal successors, (466), 164 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 466 transitions. [2021-06-05 22:13:54,337 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 466 transitions. Word has length 17 [2021-06-05 22:13:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:54,337 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 466 transitions. [2021-06-05 22:13:54,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 466 transitions. [2021-06-05 22:13:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:54,338 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:54,338 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:54,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 22:13:54,339 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1480345592, now seen corresponding path program 11 times [2021-06-05 22:13:54,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:54,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198641253] [2021-06-05 22:13:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:54,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:54,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198641253] [2021-06-05 22:13:54,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198641253] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:54,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:54,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:54,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478305775] [2021-06-05 22:13:54,416 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:54,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:54,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:54,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:54,417 INFO L87 Difference]: Start difference. First operand 165 states and 466 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:54,562 INFO L93 Difference]: Finished difference Result 335 states and 909 transitions. [2021-06-05 22:13:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:54,564 INFO L225 Difference]: With dead ends: 335 [2021-06-05 22:13:54,564 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 22:13:54,565 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 127.6ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 22:13:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 171. [2021-06-05 22:13:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.8411764705882354) internal successors, (483), 170 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 483 transitions. [2021-06-05 22:13:54,569 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 483 transitions. Word has length 17 [2021-06-05 22:13:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:54,570 INFO L482 AbstractCegarLoop]: Abstraction has 171 states and 483 transitions. [2021-06-05 22:13:54,570 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 483 transitions. [2021-06-05 22:13:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:54,570 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:54,570 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:54,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 22:13:54,571 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -145439044, now seen corresponding path program 12 times [2021-06-05 22:13:54,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:54,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240303809] [2021-06-05 22:13:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:54,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:54,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240303809] [2021-06-05 22:13:54,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240303809] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:54,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:54,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:54,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079498738] [2021-06-05 22:13:54,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:54,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:54,629 INFO L87 Difference]: Start difference. First operand 171 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:54,774 INFO L93 Difference]: Finished difference Result 318 states and 879 transitions. [2021-06-05 22:13:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:54,776 INFO L225 Difference]: With dead ends: 318 [2021-06-05 22:13:54,776 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 22:13:54,776 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 120.5ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 22:13:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 171. [2021-06-05 22:13:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.8411764705882354) internal successors, (483), 170 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 483 transitions. [2021-06-05 22:13:54,782 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 483 transitions. Word has length 17 [2021-06-05 22:13:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:54,782 INFO L482 AbstractCegarLoop]: Abstraction has 171 states and 483 transitions. [2021-06-05 22:13:54,782 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 483 transitions. [2021-06-05 22:13:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:54,783 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:54,783 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:54,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 22:13:54,783 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 161256120, now seen corresponding path program 13 times [2021-06-05 22:13:54,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:54,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319807027] [2021-06-05 22:13:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:54,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:54,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319807027] [2021-06-05 22:13:54,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319807027] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:54,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:54,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:54,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783474621] [2021-06-05 22:13:54,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:54,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:54,844 INFO L87 Difference]: Start difference. First operand 171 states and 483 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:55,008 INFO L93 Difference]: Finished difference Result 385 states and 1046 transitions. [2021-06-05 22:13:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:55,010 INFO L225 Difference]: With dead ends: 385 [2021-06-05 22:13:55,011 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 22:13:55,011 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 130.9ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 22:13:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 174. [2021-06-05 22:13:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.878612716763006) internal successors, (498), 173 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 22:13:55,017 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 22:13:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:55,017 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 22:13:55,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 22:13:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:55,017 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:55,018 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:55,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 22:13:55,018 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1057379240, now seen corresponding path program 14 times [2021-06-05 22:13:55,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:55,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894473997] [2021-06-05 22:13:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:55,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:55,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894473997] [2021-06-05 22:13:55,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894473997] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:55,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:55,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:55,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659388790] [2021-06-05 22:13:55,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:55,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:55,078 INFO L87 Difference]: Start difference. First operand 174 states and 498 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:55,222 INFO L93 Difference]: Finished difference Result 383 states and 1039 transitions. [2021-06-05 22:13:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:55,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:55,225 INFO L225 Difference]: With dead ends: 383 [2021-06-05 22:13:55,225 INFO L226 Difference]: Without dead ends: 368 [2021-06-05 22:13:55,225 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 126.6ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-06-05 22:13:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 174. [2021-06-05 22:13:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.878612716763006) internal successors, (498), 173 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 22:13:55,231 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 22:13:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:55,231 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 22:13:55,231 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 22:13:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:55,231 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:55,232 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:55,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 22:13:55,232 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1150316668, now seen corresponding path program 15 times [2021-06-05 22:13:55,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:55,232 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508428164] [2021-06-05 22:13:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:55,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:55,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508428164] [2021-06-05 22:13:55,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508428164] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:55,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:55,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:55,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783260063] [2021-06-05 22:13:55,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:55,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:55,297 INFO L87 Difference]: Start difference. First operand 174 states and 498 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:55,498 INFO L93 Difference]: Finished difference Result 392 states and 1055 transitions. [2021-06-05 22:13:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:55,500 INFO L225 Difference]: With dead ends: 392 [2021-06-05 22:13:55,500 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 22:13:55,500 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 22:13:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 177. [2021-06-05 22:13:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.909090909090909) internal successors, (512), 176 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2021-06-05 22:13:55,506 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 17 [2021-06-05 22:13:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:55,506 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2021-06-05 22:13:55,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2021-06-05 22:13:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:55,507 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:55,507 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:55,507 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 22:13:55,507 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash -19872328, now seen corresponding path program 16 times [2021-06-05 22:13:55,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:55,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656417443] [2021-06-05 22:13:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:55,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:55,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656417443] [2021-06-05 22:13:55,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656417443] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:55,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:55,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:55,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761392736] [2021-06-05 22:13:55,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:55,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:55,574 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:55,756 INFO L93 Difference]: Finished difference Result 376 states and 1032 transitions. [2021-06-05 22:13:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:55,758 INFO L225 Difference]: With dead ends: 376 [2021-06-05 22:13:55,758 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 22:13:55,759 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 152.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 22:13:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 174. [2021-06-05 22:13:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.878612716763006) internal successors, (498), 173 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 22:13:55,764 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 22:13:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:55,764 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 22:13:55,764 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 22:13:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:55,765 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:55,765 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:55,765 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 22:13:55,765 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash -36809380, now seen corresponding path program 17 times [2021-06-05 22:13:55,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:55,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728039257] [2021-06-05 22:13:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:55,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:55,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728039257] [2021-06-05 22:13:55,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728039257] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:55,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:55,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:55,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029578335] [2021-06-05 22:13:55,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:55,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:55,826 INFO L87 Difference]: Start difference. First operand 174 states and 498 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:55,968 INFO L93 Difference]: Finished difference Result 364 states and 991 transitions. [2021-06-05 22:13:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:55,970 INFO L225 Difference]: With dead ends: 364 [2021-06-05 22:13:55,970 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 22:13:55,970 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 110.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 22:13:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 176. [2021-06-05 22:13:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.8971428571428572) internal successors, (507), 175 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 507 transitions. [2021-06-05 22:13:55,975 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 507 transitions. Word has length 17 [2021-06-05 22:13:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:55,976 INFO L482 AbstractCegarLoop]: Abstraction has 176 states and 507 transitions. [2021-06-05 22:13:55,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 507 transitions. [2021-06-05 22:13:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:55,976 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:55,976 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:55,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 22:13:55,977 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1103474456, now seen corresponding path program 18 times [2021-06-05 22:13:55,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:55,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282314913] [2021-06-05 22:13:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:56,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:56,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282314913] [2021-06-05 22:13:56,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282314913] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:56,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:56,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:56,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024812536] [2021-06-05 22:13:56,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:56,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:56,030 INFO L87 Difference]: Start difference. First operand 176 states and 507 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:56,183 INFO L93 Difference]: Finished difference Result 343 states and 953 transitions. [2021-06-05 22:13:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:56,185 INFO L225 Difference]: With dead ends: 343 [2021-06-05 22:13:56,185 INFO L226 Difference]: Without dead ends: 328 [2021-06-05 22:13:56,188 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 104.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-06-05 22:13:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 174. [2021-06-05 22:13:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.878612716763006) internal successors, (498), 173 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 22:13:56,197 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 22:13:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:56,198 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 22:13:56,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 22:13:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:56,198 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:56,198 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:56,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 22:13:56,198 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1622951230, now seen corresponding path program 19 times [2021-06-05 22:13:56,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:56,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351835576] [2021-06-05 22:13:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:56,261 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:56,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351835576] [2021-06-05 22:13:56,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351835576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:56,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:56,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:56,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917858190] [2021-06-05 22:13:56,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:56,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:56,263 INFO L87 Difference]: Start difference. First operand 174 states and 498 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:56,368 INFO L93 Difference]: Finished difference Result 360 states and 983 transitions. [2021-06-05 22:13:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:56,370 INFO L225 Difference]: With dead ends: 360 [2021-06-05 22:13:56,370 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 22:13:56,370 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 93.9ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 22:13:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 177. [2021-06-05 22:13:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.897727272727273) internal successors, (510), 176 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 22:13:56,376 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 22:13:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:56,376 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 22:13:56,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 22:13:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:56,376 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:56,376 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:56,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 22:13:56,377 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1422092646, now seen corresponding path program 20 times [2021-06-05 22:13:56,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:56,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810739664] [2021-06-05 22:13:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:56,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:56,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810739664] [2021-06-05 22:13:56,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810739664] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:56,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:56,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:56,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715798877] [2021-06-05 22:13:56,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:56,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:56,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:56,429 INFO L87 Difference]: Start difference. First operand 177 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:56,576 INFO L93 Difference]: Finished difference Result 377 states and 1017 transitions. [2021-06-05 22:13:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:56,578 INFO L225 Difference]: With dead ends: 377 [2021-06-05 22:13:56,578 INFO L226 Difference]: Without dead ends: 362 [2021-06-05 22:13:56,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 109.6ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-06-05 22:13:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 179. [2021-06-05 22:13:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.9157303370786516) internal successors, (519), 178 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 519 transitions. [2021-06-05 22:13:56,583 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 519 transitions. Word has length 17 [2021-06-05 22:13:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:56,583 INFO L482 AbstractCegarLoop]: Abstraction has 179 states and 519 transitions. [2021-06-05 22:13:56,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 519 transitions. [2021-06-05 22:13:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:56,584 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:56,584 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:56,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 22:13:56,584 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash 203457286, now seen corresponding path program 21 times [2021-06-05 22:13:56,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:56,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129687214] [2021-06-05 22:13:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:56,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:56,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129687214] [2021-06-05 22:13:56,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129687214] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:56,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:56,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:56,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739922245] [2021-06-05 22:13:56,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:56,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:56,641 INFO L87 Difference]: Start difference. First operand 179 states and 519 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:56,798 INFO L93 Difference]: Finished difference Result 354 states and 972 transitions. [2021-06-05 22:13:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:56,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:56,800 INFO L225 Difference]: With dead ends: 354 [2021-06-05 22:13:56,800 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 22:13:56,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 134.0ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 22:13:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 177. [2021-06-05 22:13:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.897727272727273) internal successors, (510), 176 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 22:13:56,805 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 22:13:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:56,805 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 22:13:56,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 22:13:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:56,806 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:56,806 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:56,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 22:13:56,806 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1026845314, now seen corresponding path program 22 times [2021-06-05 22:13:56,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:56,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769274487] [2021-06-05 22:13:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:56,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:56,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769274487] [2021-06-05 22:13:56,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769274487] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:56,876 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:56,876 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:56,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522602627] [2021-06-05 22:13:56,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:56,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:56,877 INFO L87 Difference]: Start difference. First operand 177 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:57,090 INFO L93 Difference]: Finished difference Result 409 states and 1106 transitions. [2021-06-05 22:13:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:57,092 INFO L225 Difference]: With dead ends: 409 [2021-06-05 22:13:57,092 INFO L226 Difference]: Without dead ends: 394 [2021-06-05 22:13:57,092 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 199.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-06-05 22:13:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 180. [2021-06-05 22:13:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.910614525139665) internal successors, (521), 179 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 521 transitions. [2021-06-05 22:13:57,097 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 521 transitions. Word has length 17 [2021-06-05 22:13:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:57,098 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 521 transitions. [2021-06-05 22:13:57,098 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 521 transitions. [2021-06-05 22:13:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:57,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:57,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:57,098 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 22:13:57,098 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:57,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:57,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1848016830, now seen corresponding path program 23 times [2021-06-05 22:13:57,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:57,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505952521] [2021-06-05 22:13:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:57,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:57,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505952521] [2021-06-05 22:13:57,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505952521] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:57,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:57,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:57,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029409163] [2021-06-05 22:13:57,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:57,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:57,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:57,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:57,174 INFO L87 Difference]: Start difference. First operand 180 states and 521 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:57,444 INFO L93 Difference]: Finished difference Result 407 states and 1110 transitions. [2021-06-05 22:13:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:57,446 INFO L225 Difference]: With dead ends: 407 [2021-06-05 22:13:57,446 INFO L226 Difference]: Without dead ends: 392 [2021-06-05 22:13:57,447 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 244.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-06-05 22:13:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 183. [2021-06-05 22:13:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.9395604395604398) internal successors, (535), 182 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 535 transitions. [2021-06-05 22:13:57,453 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 535 transitions. Word has length 17 [2021-06-05 22:13:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:57,453 INFO L482 AbstractCegarLoop]: Abstraction has 183 states and 535 transitions. [2021-06-05 22:13:57,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 535 transitions. [2021-06-05 22:13:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:57,454 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:57,454 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:57,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 22:13:57,454 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash 748230078, now seen corresponding path program 24 times [2021-06-05 22:13:57,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:57,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437065192] [2021-06-05 22:13:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:57,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:57,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437065192] [2021-06-05 22:13:57,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437065192] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:57,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:57,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:57,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92951731] [2021-06-05 22:13:57,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:57,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:57,543 INFO L87 Difference]: Start difference. First operand 183 states and 535 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:57,783 INFO L93 Difference]: Finished difference Result 384 states and 1065 transitions. [2021-06-05 22:13:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:57,785 INFO L225 Difference]: With dead ends: 384 [2021-06-05 22:13:57,785 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 22:13:57,786 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 219.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 22:13:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 177. [2021-06-05 22:13:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.897727272727273) internal successors, (510), 176 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 22:13:57,794 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 22:13:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:57,794 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 22:13:57,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 22:13:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:57,795 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:57,795 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:57,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 22:13:57,795 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1951172510, now seen corresponding path program 25 times [2021-06-05 22:13:57,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:57,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102070228] [2021-06-05 22:13:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:57,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:57,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102070228] [2021-06-05 22:13:57,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102070228] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:57,851 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:57,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:57,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114977234] [2021-06-05 22:13:57,852 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:57,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:57,852 INFO L87 Difference]: Start difference. First operand 177 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:58,015 INFO L93 Difference]: Finished difference Result 403 states and 1103 transitions. [2021-06-05 22:13:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:58,018 INFO L225 Difference]: With dead ends: 403 [2021-06-05 22:13:58,018 INFO L226 Difference]: Without dead ends: 388 [2021-06-05 22:13:58,018 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 127.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-06-05 22:13:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 180. [2021-06-05 22:13:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.9329608938547485) internal successors, (525), 179 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 525 transitions. [2021-06-05 22:13:58,022 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 525 transitions. Word has length 17 [2021-06-05 22:13:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:58,023 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 525 transitions. [2021-06-05 22:13:58,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 525 transitions. [2021-06-05 22:13:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:58,023 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:58,023 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:58,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 22:13:58,024 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1125159426, now seen corresponding path program 26 times [2021-06-05 22:13:58,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:58,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818410814] [2021-06-05 22:13:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:58,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:58,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818410814] [2021-06-05 22:13:58,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818410814] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:58,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:58,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:58,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961465815] [2021-06-05 22:13:58,088 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:58,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:58,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:58,089 INFO L87 Difference]: Start difference. First operand 180 states and 525 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:58,252 INFO L93 Difference]: Finished difference Result 401 states and 1096 transitions. [2021-06-05 22:13:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:58,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:58,254 INFO L225 Difference]: With dead ends: 401 [2021-06-05 22:13:58,254 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 22:13:58,254 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 122.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 22:13:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 178. [2021-06-05 22:13:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.9152542372881354) internal successors, (516), 177 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 516 transitions. [2021-06-05 22:13:58,260 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 516 transitions. Word has length 17 [2021-06-05 22:13:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:58,260 INFO L482 AbstractCegarLoop]: Abstraction has 178 states and 516 transitions. [2021-06-05 22:13:58,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 516 transitions. [2021-06-05 22:13:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:58,261 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:58,261 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:58,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 22:13:58,261 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -962111962, now seen corresponding path program 27 times [2021-06-05 22:13:58,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:58,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048200519] [2021-06-05 22:13:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:58,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:58,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048200519] [2021-06-05 22:13:58,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048200519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:58,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:58,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:58,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729543736] [2021-06-05 22:13:58,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:58,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:58,323 INFO L87 Difference]: Start difference. First operand 178 states and 516 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:58,507 INFO L93 Difference]: Finished difference Result 395 states and 1075 transitions. [2021-06-05 22:13:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:58,508 INFO L225 Difference]: With dead ends: 395 [2021-06-05 22:13:58,508 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 22:13:58,508 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 148.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 22:13:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 181. [2021-06-05 22:13:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.9444444444444446) internal successors, (530), 180 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 530 transitions. [2021-06-05 22:13:58,514 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 530 transitions. Word has length 17 [2021-06-05 22:13:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:58,514 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 530 transitions. [2021-06-05 22:13:58,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 530 transitions. [2021-06-05 22:13:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:58,515 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:58,515 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:58,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 22:13:58,515 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2132300958, now seen corresponding path program 28 times [2021-06-05 22:13:58,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:58,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227187169] [2021-06-05 22:13:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:58,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:58,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227187169] [2021-06-05 22:13:58,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227187169] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:58,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:58,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:58,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15121730] [2021-06-05 22:13:58,577 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:58,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:58,577 INFO L87 Difference]: Start difference. First operand 181 states and 530 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:58,754 INFO L93 Difference]: Finished difference Result 379 states and 1052 transitions. [2021-06-05 22:13:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:58,756 INFO L225 Difference]: With dead ends: 379 [2021-06-05 22:13:58,756 INFO L226 Difference]: Without dead ends: 364 [2021-06-05 22:13:58,756 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 139.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-06-05 22:13:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 178. [2021-06-05 22:13:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.9152542372881354) internal successors, (516), 177 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 516 transitions. [2021-06-05 22:13:58,761 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 516 transitions. Word has length 17 [2021-06-05 22:13:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:58,762 INFO L482 AbstractCegarLoop]: Abstraction has 178 states and 516 transitions. [2021-06-05 22:13:58,762 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 516 transitions. [2021-06-05 22:13:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:58,762 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:58,762 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:58,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 22:13:58,763 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2145729286, now seen corresponding path program 29 times [2021-06-05 22:13:58,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:58,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804022051] [2021-06-05 22:13:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:58,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:58,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804022051] [2021-06-05 22:13:58,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804022051] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:58,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:58,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:58,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607170583] [2021-06-05 22:13:58,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:58,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:58,827 INFO L87 Difference]: Start difference. First operand 178 states and 516 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:58,967 INFO L93 Difference]: Finished difference Result 363 states and 1003 transitions. [2021-06-05 22:13:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:58,969 INFO L225 Difference]: With dead ends: 363 [2021-06-05 22:13:58,969 INFO L226 Difference]: Without dead ends: 348 [2021-06-05 22:13:58,970 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-06-05 22:13:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 180. [2021-06-05 22:13:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.9329608938547485) internal successors, (525), 179 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 525 transitions. [2021-06-05 22:13:58,974 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 525 transitions. Word has length 17 [2021-06-05 22:13:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:58,974 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 525 transitions. [2021-06-05 22:13:58,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 525 transitions. [2021-06-05 22:13:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:58,975 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:58,975 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:58,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 22:13:58,975 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1008954174, now seen corresponding path program 30 times [2021-06-05 22:13:58,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:58,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322393203] [2021-06-05 22:13:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:59,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:59,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322393203] [2021-06-05 22:13:59,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322393203] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:59,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:59,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:59,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237526351] [2021-06-05 22:13:59,027 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:59,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:59,027 INFO L87 Difference]: Start difference. First operand 180 states and 525 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:59,165 INFO L93 Difference]: Finished difference Result 342 states and 965 transitions. [2021-06-05 22:13:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:59,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:59,167 INFO L225 Difference]: With dead ends: 342 [2021-06-05 22:13:59,167 INFO L226 Difference]: Without dead ends: 327 [2021-06-05 22:13:59,167 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.9ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:13:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-06-05 22:13:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 177. [2021-06-05 22:13:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.897727272727273) internal successors, (510), 176 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 22:13:59,172 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 22:13:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:59,172 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 22:13:59,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 22:13:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:59,172 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:59,173 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:59,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 22:13:59,173 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1057121422, now seen corresponding path program 31 times [2021-06-05 22:13:59,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:59,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113878400] [2021-06-05 22:13:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:59,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:59,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113878400] [2021-06-05 22:13:59,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113878400] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:59,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:59,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:59,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993005376] [2021-06-05 22:13:59,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:59,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:59,248 INFO L87 Difference]: Start difference. First operand 177 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:59,449 INFO L93 Difference]: Finished difference Result 377 states and 1036 transitions. [2021-06-05 22:13:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:59,450 INFO L225 Difference]: With dead ends: 377 [2021-06-05 22:13:59,450 INFO L226 Difference]: Without dead ends: 362 [2021-06-05 22:13:59,450 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 186.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-06-05 22:13:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 186. [2021-06-05 22:13:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.9513513513513514) internal successors, (546), 185 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2021-06-05 22:13:59,454 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 17 [2021-06-05 22:13:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:59,454 INFO L482 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2021-06-05 22:13:59,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2021-06-05 22:13:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:59,455 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:59,455 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:59,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 22:13:59,455 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2030292802, now seen corresponding path program 32 times [2021-06-05 22:13:59,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:59,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230457389] [2021-06-05 22:13:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:59,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:59,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230457389] [2021-06-05 22:13:59,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230457389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:59,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:59,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:59,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181104556] [2021-06-05 22:13:59,517 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:59,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:59,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:59,518 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:59,704 INFO L93 Difference]: Finished difference Result 386 states and 1062 transitions. [2021-06-05 22:13:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:59,705 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:13:59,705 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 22:13:59,705 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 166.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 22:13:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 189. [2021-06-05 22:13:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.978723404255319) internal successors, (560), 188 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2021-06-05 22:13:59,710 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 17 [2021-06-05 22:13:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:59,710 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2021-06-05 22:13:59,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2021-06-05 22:13:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:59,711 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:59,711 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:59,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 22:13:59,711 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 565954106, now seen corresponding path program 33 times [2021-06-05 22:13:59,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:59,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369006690] [2021-06-05 22:13:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:13:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:13:59,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:13:59,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369006690] [2021-06-05 22:13:59,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369006690] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:13:59,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:13:59,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:13:59,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881743915] [2021-06-05 22:13:59,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:13:59,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:13:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:13:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:13:59,775 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:13:59,957 INFO L93 Difference]: Finished difference Result 393 states and 1078 transitions. [2021-06-05 22:13:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:13:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:13:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:13:59,963 INFO L225 Difference]: With dead ends: 393 [2021-06-05 22:13:59,964 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 22:13:59,964 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 170.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:13:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 22:13:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 181. [2021-06-05 22:13:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.933333333333333) internal successors, (528), 180 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 528 transitions. [2021-06-05 22:13:59,968 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 528 transitions. Word has length 17 [2021-06-05 22:13:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:13:59,968 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 528 transitions. [2021-06-05 22:13:59,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:13:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 528 transitions. [2021-06-05 22:13:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:13:59,969 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:13:59,969 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:13:59,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 22:13:59,969 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:13:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:13:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2049664750, now seen corresponding path program 34 times [2021-06-05 22:13:59,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:13:59,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671811078] [2021-06-05 22:13:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:13:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:00,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:00,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671811078] [2021-06-05 22:14:00,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671811078] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:00,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:00,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:00,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265885752] [2021-06-05 22:14:00,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:00,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:00,023 INFO L87 Difference]: Start difference. First operand 181 states and 528 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:00,152 INFO L93 Difference]: Finished difference Result 438 states and 1184 transitions. [2021-06-05 22:14:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:00,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:00,154 INFO L225 Difference]: With dead ends: 438 [2021-06-05 22:14:00,154 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 22:14:00,156 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 99.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 22:14:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 185. [2021-06-05 22:14:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.9456521739130435) internal successors, (542), 184 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 542 transitions. [2021-06-05 22:14:00,161 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 542 transitions. Word has length 17 [2021-06-05 22:14:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:00,161 INFO L482 AbstractCegarLoop]: Abstraction has 185 states and 542 transitions. [2021-06-05 22:14:00,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 542 transitions. [2021-06-05 22:14:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:00,161 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:00,162 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:00,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 22:14:00,162 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 278392308, now seen corresponding path program 35 times [2021-06-05 22:14:00,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:00,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199761603] [2021-06-05 22:14:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:00,216 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:00,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199761603] [2021-06-05 22:14:00,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199761603] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:00,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:00,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:00,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454311564] [2021-06-05 22:14:00,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:00,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:00,217 INFO L87 Difference]: Start difference. First operand 185 states and 542 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:00,370 INFO L93 Difference]: Finished difference Result 433 states and 1175 transitions. [2021-06-05 22:14:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:00,371 INFO L225 Difference]: With dead ends: 433 [2021-06-05 22:14:00,372 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 22:14:00,372 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 125.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 22:14:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 187. [2021-06-05 22:14:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.9623655913978495) internal successors, (551), 186 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2021-06-05 22:14:00,376 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 17 [2021-06-05 22:14:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:00,377 INFO L482 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2021-06-05 22:14:00,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2021-06-05 22:14:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:00,377 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:00,377 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:00,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 22:14:00,377 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1347392328, now seen corresponding path program 36 times [2021-06-05 22:14:00,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:00,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752396974] [2021-06-05 22:14:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:00,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:00,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752396974] [2021-06-05 22:14:00,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752396974] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:00,439 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:00,439 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:00,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400817554] [2021-06-05 22:14:00,439 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:00,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:00,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:00,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:00,440 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:00,587 INFO L93 Difference]: Finished difference Result 416 states and 1145 transitions. [2021-06-05 22:14:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:00,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:00,589 INFO L225 Difference]: With dead ends: 416 [2021-06-05 22:14:00,589 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 22:14:00,589 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 22:14:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 181. [2021-06-05 22:14:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.933333333333333) internal successors, (528), 180 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 528 transitions. [2021-06-05 22:14:00,594 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 528 transitions. Word has length 17 [2021-06-05 22:14:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:00,594 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 528 transitions. [2021-06-05 22:14:00,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 528 transitions. [2021-06-05 22:14:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:00,595 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:00,595 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:00,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 22:14:00,595 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1040697164, now seen corresponding path program 37 times [2021-06-05 22:14:00,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:00,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798632865] [2021-06-05 22:14:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:00,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:00,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798632865] [2021-06-05 22:14:00,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798632865] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:00,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:00,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:00,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314017266] [2021-06-05 22:14:00,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:00,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:00,646 INFO L87 Difference]: Start difference. First operand 181 states and 528 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:00,776 INFO L93 Difference]: Finished difference Result 437 states and 1201 transitions. [2021-06-05 22:14:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:00,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:00,779 INFO L225 Difference]: With dead ends: 437 [2021-06-05 22:14:00,779 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 22:14:00,779 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.9ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 22:14:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 184. [2021-06-05 22:14:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.9672131147540983) internal successors, (543), 183 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2021-06-05 22:14:00,783 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 17 [2021-06-05 22:14:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:00,783 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2021-06-05 22:14:00,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2021-06-05 22:14:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:00,784 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:00,784 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:00,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 22:14:00,784 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2035634772, now seen corresponding path program 38 times [2021-06-05 22:14:00,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:00,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505163739] [2021-06-05 22:14:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:00,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:00,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505163739] [2021-06-05 22:14:00,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505163739] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:00,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:00,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:00,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238483031] [2021-06-05 22:14:00,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:00,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:00,841 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:00,971 INFO L93 Difference]: Finished difference Result 435 states and 1194 transitions. [2021-06-05 22:14:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:00,973 INFO L225 Difference]: With dead ends: 435 [2021-06-05 22:14:00,973 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 22:14:00,974 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 22:14:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 182. [2021-06-05 22:14:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.9502762430939224) internal successors, (534), 181 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 534 transitions. [2021-06-05 22:14:00,978 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 534 transitions. Word has length 17 [2021-06-05 22:14:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:00,978 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 534 transitions. [2021-06-05 22:14:00,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 534 transitions. [2021-06-05 22:14:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:00,978 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:00,978 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:00,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 22:14:00,979 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash -51636616, now seen corresponding path program 39 times [2021-06-05 22:14:00,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:00,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827089997] [2021-06-05 22:14:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:01,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:01,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827089997] [2021-06-05 22:14:01,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827089997] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:01,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:01,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:01,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390605891] [2021-06-05 22:14:01,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:01,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:01,037 INFO L87 Difference]: Start difference. First operand 182 states and 534 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:01,217 INFO L93 Difference]: Finished difference Result 468 states and 1258 transitions. [2021-06-05 22:14:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:01,219 INFO L225 Difference]: With dead ends: 468 [2021-06-05 22:14:01,220 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 22:14:01,220 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 150.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 22:14:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 185. [2021-06-05 22:14:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.9782608695652173) internal successors, (548), 184 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 548 transitions. [2021-06-05 22:14:01,225 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 548 transitions. Word has length 17 [2021-06-05 22:14:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:01,225 INFO L482 AbstractCegarLoop]: Abstraction has 185 states and 548 transitions. [2021-06-05 22:14:01,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 548 transitions. [2021-06-05 22:14:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:01,226 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:01,226 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:01,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 22:14:01,226 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1221825612, now seen corresponding path program 40 times [2021-06-05 22:14:01,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:01,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357020650] [2021-06-05 22:14:01,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:01,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:01,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357020650] [2021-06-05 22:14:01,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357020650] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:01,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:01,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:01,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244353058] [2021-06-05 22:14:01,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:01,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:01,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:01,290 INFO L87 Difference]: Start difference. First operand 185 states and 548 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:01,481 INFO L93 Difference]: Finished difference Result 452 states and 1235 transitions. [2021-06-05 22:14:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:01,483 INFO L225 Difference]: With dead ends: 452 [2021-06-05 22:14:01,483 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 22:14:01,483 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 159.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 22:14:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 182. [2021-06-05 22:14:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.9502762430939224) internal successors, (534), 181 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 534 transitions. [2021-06-05 22:14:01,488 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 534 transitions. Word has length 17 [2021-06-05 22:14:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:01,488 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 534 transitions. [2021-06-05 22:14:01,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 534 transitions. [2021-06-05 22:14:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:01,489 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:01,489 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:01,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 22:14:01,489 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1238762664, now seen corresponding path program 41 times [2021-06-05 22:14:01,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:01,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179659469] [2021-06-05 22:14:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:01,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:01,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179659469] [2021-06-05 22:14:01,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179659469] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:01,543 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:01,543 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:01,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839578177] [2021-06-05 22:14:01,543 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:01,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:01,544 INFO L87 Difference]: Start difference. First operand 182 states and 534 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:01,692 INFO L93 Difference]: Finished difference Result 446 states and 1215 transitions. [2021-06-05 22:14:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:01,693 INFO L225 Difference]: With dead ends: 446 [2021-06-05 22:14:01,693 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 22:14:01,693 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 119.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:01,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 22:14:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 184. [2021-06-05 22:14:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.9672131147540983) internal successors, (543), 183 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2021-06-05 22:14:01,697 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 17 [2021-06-05 22:14:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:01,698 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2021-06-05 22:14:01,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2021-06-05 22:14:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:01,698 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:01,698 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:01,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 22:14:01,698 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -98478828, now seen corresponding path program 42 times [2021-06-05 22:14:01,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:01,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602172415] [2021-06-05 22:14:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:01,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:01,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602172415] [2021-06-05 22:14:01,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602172415] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:01,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:01,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:01,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572362459] [2021-06-05 22:14:01,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:01,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:01,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:01,748 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:01,894 INFO L93 Difference]: Finished difference Result 425 states and 1177 transitions. [2021-06-05 22:14:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:01,896 INFO L225 Difference]: With dead ends: 425 [2021-06-05 22:14:01,896 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 22:14:01,896 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 22:14:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 179. [2021-06-05 22:14:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.9101123595505616) internal successors, (518), 178 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 518 transitions. [2021-06-05 22:14:01,899 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 518 transitions. Word has length 17 [2021-06-05 22:14:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:01,899 INFO L482 AbstractCegarLoop]: Abstraction has 179 states and 518 transitions. [2021-06-05 22:14:01,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 518 transitions. [2021-06-05 22:14:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:01,900 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:01,900 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:01,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 22:14:01,900 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash -485249606, now seen corresponding path program 43 times [2021-06-05 22:14:01,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:01,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161798113] [2021-06-05 22:14:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:01,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:01,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161798113] [2021-06-05 22:14:01,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161798113] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:01,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:01,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:01,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234166034] [2021-06-05 22:14:01,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:01,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:01,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:01,962 INFO L87 Difference]: Start difference. First operand 179 states and 518 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:02,065 INFO L93 Difference]: Finished difference Result 323 states and 889 transitions. [2021-06-05 22:14:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:02,066 INFO L225 Difference]: With dead ends: 323 [2021-06-05 22:14:02,066 INFO L226 Difference]: Without dead ends: 308 [2021-06-05 22:14:02,066 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-06-05 22:14:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 187. [2021-06-05 22:14:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.913978494623656) internal successors, (542), 186 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2021-06-05 22:14:02,070 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 17 [2021-06-05 22:14:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:02,070 INFO L482 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2021-06-05 22:14:02,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2021-06-05 22:14:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:02,070 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:02,071 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:02,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 22:14:02,071 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2038445248, now seen corresponding path program 44 times [2021-06-05 22:14:02,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:02,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657566440] [2021-06-05 22:14:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:02,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:02,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657566440] [2021-06-05 22:14:02,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657566440] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:02,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:02,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:02,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998142242] [2021-06-05 22:14:02,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:02,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:02,143 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:02,283 INFO L93 Difference]: Finished difference Result 353 states and 951 transitions. [2021-06-05 22:14:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:02,284 INFO L225 Difference]: With dead ends: 353 [2021-06-05 22:14:02,284 INFO L226 Difference]: Without dead ends: 338 [2021-06-05 22:14:02,285 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 129.9ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-06-05 22:14:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 189. [2021-06-05 22:14:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.9308510638297873) internal successors, (551), 188 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2021-06-05 22:14:02,288 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 17 [2021-06-05 22:14:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:02,288 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2021-06-05 22:14:02,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2021-06-05 22:14:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:02,289 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:02,289 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:02,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 22:14:02,289 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 412660612, now seen corresponding path program 45 times [2021-06-05 22:14:02,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:02,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393134797] [2021-06-05 22:14:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:02,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:02,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393134797] [2021-06-05 22:14:02,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393134797] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:02,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:02,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:02,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491958401] [2021-06-05 22:14:02,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:02,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:02,345 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:02,474 INFO L93 Difference]: Finished difference Result 336 states and 921 transitions. [2021-06-05 22:14:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:02,475 INFO L225 Difference]: With dead ends: 336 [2021-06-05 22:14:02,475 INFO L226 Difference]: Without dead ends: 321 [2021-06-05 22:14:02,475 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 115.9ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-06-05 22:14:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 183. [2021-06-05 22:14:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.901098901098901) internal successors, (528), 182 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2021-06-05 22:14:02,480 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 17 [2021-06-05 22:14:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:02,480 INFO L482 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2021-06-05 22:14:02,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2021-06-05 22:14:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:02,480 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:02,480 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:02,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 22:14:02,481 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:02,481 INFO L82 PathProgramCache]: Analyzing trace with hash 379489126, now seen corresponding path program 46 times [2021-06-05 22:14:02,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:02,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566596601] [2021-06-05 22:14:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:02,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:02,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566596601] [2021-06-05 22:14:02,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566596601] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:02,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:02,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:02,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054158780] [2021-06-05 22:14:02,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:02,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:02,551 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:02,652 INFO L93 Difference]: Finished difference Result 324 states and 889 transitions. [2021-06-05 22:14:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:02,653 INFO L225 Difference]: With dead ends: 324 [2021-06-05 22:14:02,653 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 22:14:02,653 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 22:14:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 189. [2021-06-05 22:14:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.8882978723404253) internal successors, (543), 188 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 543 transitions. [2021-06-05 22:14:02,656 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 543 transitions. Word has length 17 [2021-06-05 22:14:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:02,656 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 543 transitions. [2021-06-05 22:14:02,656 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 543 transitions. [2021-06-05 22:14:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:02,657 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:02,657 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:02,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 22:14:02,657 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1252190110, now seen corresponding path program 47 times [2021-06-05 22:14:02,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:02,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330196521] [2021-06-05 22:14:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:02,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:02,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330196521] [2021-06-05 22:14:02,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330196521] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:02,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:02,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:02,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684140120] [2021-06-05 22:14:02,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:02,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:02,713 INFO L87 Difference]: Start difference. First operand 189 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:02,856 INFO L93 Difference]: Finished difference Result 354 states and 954 transitions. [2021-06-05 22:14:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:02,857 INFO L225 Difference]: With dead ends: 354 [2021-06-05 22:14:02,857 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 22:14:02,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 118.0ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 22:14:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 191. [2021-06-05 22:14:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.905263157894737) internal successors, (552), 190 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 552 transitions. [2021-06-05 22:14:02,862 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 552 transitions. Word has length 17 [2021-06-05 22:14:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:02,862 INFO L482 AbstractCegarLoop]: Abstraction has 191 states and 552 transitions. [2021-06-05 22:14:02,862 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 552 transitions. [2021-06-05 22:14:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:02,862 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:02,862 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:02,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 22:14:02,863 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1416992550, now seen corresponding path program 48 times [2021-06-05 22:14:02,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:02,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526408570] [2021-06-05 22:14:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:02,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:02,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526408570] [2021-06-05 22:14:02,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526408570] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:02,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:02,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:02,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153291311] [2021-06-05 22:14:02,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:02,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:02,911 INFO L87 Difference]: Start difference. First operand 191 states and 552 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:03,051 INFO L93 Difference]: Finished difference Result 333 states and 916 transitions. [2021-06-05 22:14:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:03,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:03,052 INFO L225 Difference]: With dead ends: 333 [2021-06-05 22:14:03,052 INFO L226 Difference]: Without dead ends: 318 [2021-06-05 22:14:03,052 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-06-05 22:14:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 189. [2021-06-05 22:14:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.8882978723404253) internal successors, (543), 188 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 543 transitions. [2021-06-05 22:14:03,057 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 543 transitions. Word has length 17 [2021-06-05 22:14:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:03,057 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 543 transitions. [2021-06-05 22:14:03,057 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 543 transitions. [2021-06-05 22:14:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:03,057 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:03,057 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:03,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 22:14:03,058 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -167418646, now seen corresponding path program 49 times [2021-06-05 22:14:03,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:03,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129668202] [2021-06-05 22:14:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:03,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:03,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129668202] [2021-06-05 22:14:03,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129668202] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:03,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:03,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:03,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959067615] [2021-06-05 22:14:03,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:03,109 INFO L87 Difference]: Start difference. First operand 189 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:03,233 INFO L93 Difference]: Finished difference Result 386 states and 1068 transitions. [2021-06-05 22:14:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:03,234 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:14:03,234 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 22:14:03,234 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 106.3ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 22:14:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 194. [2021-06-05 22:14:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.922279792746114) internal successors, (564), 193 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 564 transitions. [2021-06-05 22:14:03,238 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 564 transitions. Word has length 17 [2021-06-05 22:14:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:03,239 INFO L482 AbstractCegarLoop]: Abstraction has 194 states and 564 transitions. [2021-06-05 22:14:03,239 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 564 transitions. [2021-06-05 22:14:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:03,239 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:03,239 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:03,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 22:14:03,240 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1386054006, now seen corresponding path program 50 times [2021-06-05 22:14:03,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:03,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018024496] [2021-06-05 22:14:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:03,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:03,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018024496] [2021-06-05 22:14:03,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018024496] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:03,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:03,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:03,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128606658] [2021-06-05 22:14:03,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:03,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:03,298 INFO L87 Difference]: Start difference. First operand 194 states and 564 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:03,464 INFO L93 Difference]: Finished difference Result 390 states and 1074 transitions. [2021-06-05 22:14:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:03,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:03,465 INFO L225 Difference]: With dead ends: 390 [2021-06-05 22:14:03,465 INFO L226 Difference]: Without dead ends: 375 [2021-06-05 22:14:03,465 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 138.7ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-06-05 22:14:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 192. [2021-06-05 22:14:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.905759162303665) internal successors, (555), 191 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 22:14:03,470 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 22:14:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:03,470 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 22:14:03,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 22:14:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:03,471 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:03,471 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:03,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 22:14:03,471 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash -310342850, now seen corresponding path program 51 times [2021-06-05 22:14:03,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:03,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688752454] [2021-06-05 22:14:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:03,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:03,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688752454] [2021-06-05 22:14:03,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688752454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:03,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:03,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:03,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396124186] [2021-06-05 22:14:03,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:03,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:03,529 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:03,645 INFO L93 Difference]: Finished difference Result 386 states and 1060 transitions. [2021-06-05 22:14:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:03,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:03,646 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:14:03,646 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 22:14:03,647 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 22:14:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 192. [2021-06-05 22:14:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.905759162303665) internal successors, (555), 191 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 22:14:03,650 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 22:14:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:03,651 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 22:14:03,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 22:14:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:03,651 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:03,651 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:03,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 22:14:03,651 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -548101402, now seen corresponding path program 52 times [2021-06-05 22:14:03,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:03,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636462064] [2021-06-05 22:14:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:03,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:03,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636462064] [2021-06-05 22:14:03,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636462064] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:03,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:03,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:03,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511294577] [2021-06-05 22:14:03,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:03,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:03,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:03,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:03,719 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:03,859 INFO L93 Difference]: Finished difference Result 464 states and 1256 transitions. [2021-06-05 22:14:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:03,860 INFO L225 Difference]: With dead ends: 464 [2021-06-05 22:14:03,860 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 22:14:03,860 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 103.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 22:14:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 195. [2021-06-05 22:14:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9381443298969074) internal successors, (570), 194 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2021-06-05 22:14:03,864 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 17 [2021-06-05 22:14:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:03,864 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2021-06-05 22:14:03,864 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2021-06-05 22:14:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:03,865 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:03,865 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:03,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 22:14:03,865 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1766736762, now seen corresponding path program 53 times [2021-06-05 22:14:03,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:03,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865979593] [2021-06-05 22:14:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:03,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:03,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865979593] [2021-06-05 22:14:03,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865979593] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:03,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:03,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:03,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441717297] [2021-06-05 22:14:03,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:03,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:03,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:03,925 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:04,092 INFO L93 Difference]: Finished difference Result 468 states and 1262 transitions. [2021-06-05 22:14:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:04,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:04,093 INFO L225 Difference]: With dead ends: 468 [2021-06-05 22:14:04,093 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 22:14:04,093 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 131.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 22:14:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 193. [2021-06-05 22:14:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.921875) internal successors, (561), 192 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 561 transitions. [2021-06-05 22:14:04,099 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 561 transitions. Word has length 17 [2021-06-05 22:14:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:04,099 INFO L482 AbstractCegarLoop]: Abstraction has 193 states and 561 transitions. [2021-06-05 22:14:04,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 561 transitions. [2021-06-05 22:14:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:04,100 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:04,100 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:04,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 22:14:04,100 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 440959146, now seen corresponding path program 54 times [2021-06-05 22:14:04,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:04,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476271613] [2021-06-05 22:14:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:04,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:04,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476271613] [2021-06-05 22:14:04,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476271613] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:04,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:04,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:04,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562931421] [2021-06-05 22:14:04,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:04,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:04,169 INFO L87 Difference]: Start difference. First operand 193 states and 561 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:04,328 INFO L93 Difference]: Finished difference Result 431 states and 1182 transitions. [2021-06-05 22:14:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:04,329 INFO L225 Difference]: With dead ends: 431 [2021-06-05 22:14:04,330 INFO L226 Difference]: Without dead ends: 416 [2021-06-05 22:14:04,330 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-05 22:14:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 196. [2021-06-05 22:14:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.948717948717949) internal successors, (575), 195 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 575 transitions. [2021-06-05 22:14:04,334 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 575 transitions. Word has length 17 [2021-06-05 22:14:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:04,334 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 575 transitions. [2021-06-05 22:14:04,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 575 transitions. [2021-06-05 22:14:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:04,334 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:04,335 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:04,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 22:14:04,335 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash -729229850, now seen corresponding path program 55 times [2021-06-05 22:14:04,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:04,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454196773] [2021-06-05 22:14:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:04,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:04,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454196773] [2021-06-05 22:14:04,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454196773] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:04,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:04,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:04,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892210548] [2021-06-05 22:14:04,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:04,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:04,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:04,400 INFO L87 Difference]: Start difference. First operand 196 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:04,562 INFO L93 Difference]: Finished difference Result 415 states and 1159 transitions. [2021-06-05 22:14:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:04,565 INFO L225 Difference]: With dead ends: 415 [2021-06-05 22:14:04,565 INFO L226 Difference]: Without dead ends: 400 [2021-06-05 22:14:04,565 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 134.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-06-05 22:14:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 193. [2021-06-05 22:14:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.921875) internal successors, (561), 192 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 561 transitions. [2021-06-05 22:14:04,569 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 561 transitions. Word has length 17 [2021-06-05 22:14:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:04,569 INFO L482 AbstractCegarLoop]: Abstraction has 193 states and 561 transitions. [2021-06-05 22:14:04,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 561 transitions. [2021-06-05 22:14:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:04,570 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:04,570 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:04,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 22:14:04,570 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash -746166902, now seen corresponding path program 56 times [2021-06-05 22:14:04,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:04,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010834581] [2021-06-05 22:14:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:04,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:04,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010834581] [2021-06-05 22:14:04,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010834581] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:04,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:04,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:04,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133362219] [2021-06-05 22:14:04,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:04,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:04,639 INFO L87 Difference]: Start difference. First operand 193 states and 561 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:04,818 INFO L93 Difference]: Finished difference Result 449 states and 1229 transitions. [2021-06-05 22:14:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:04,819 INFO L225 Difference]: With dead ends: 449 [2021-06-05 22:14:04,819 INFO L226 Difference]: Without dead ends: 434 [2021-06-05 22:14:04,819 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-06-05 22:14:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 195. [2021-06-05 22:14:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9381443298969074) internal successors, (570), 194 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2021-06-05 22:14:04,824 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 17 [2021-06-05 22:14:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:04,825 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2021-06-05 22:14:04,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2021-06-05 22:14:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:04,825 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:04,825 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:04,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 22:14:04,825 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash 394116934, now seen corresponding path program 57 times [2021-06-05 22:14:04,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:04,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181583530] [2021-06-05 22:14:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:04,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:04,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181583530] [2021-06-05 22:14:04,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181583530] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:04,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:04,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:04,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389479160] [2021-06-05 22:14:04,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:04,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:04,879 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:05,051 INFO L93 Difference]: Finished difference Result 428 states and 1191 transitions. [2021-06-05 22:14:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:05,052 INFO L225 Difference]: With dead ends: 428 [2021-06-05 22:14:05,052 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 22:14:05,053 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 128.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 22:14:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 192. [2021-06-05 22:14:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.905759162303665) internal successors, (555), 191 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 22:14:05,057 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 22:14:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:05,058 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 22:14:05,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 22:14:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:05,058 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:05,058 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:05,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 22:14:05,058 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1262551738, now seen corresponding path program 58 times [2021-06-05 22:14:05,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:05,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832653811] [2021-06-05 22:14:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:05,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:05,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832653811] [2021-06-05 22:14:05,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832653811] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:05,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:05,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:05,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107435109] [2021-06-05 22:14:05,113 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:05,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:05,114 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:05,214 INFO L93 Difference]: Finished difference Result 429 states and 1161 transitions. [2021-06-05 22:14:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:05,215 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:14:05,215 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:14:05,216 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 89.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:14:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 194. [2021-06-05 22:14:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.911917098445596) internal successors, (562), 193 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 562 transitions. [2021-06-05 22:14:05,221 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 562 transitions. Word has length 17 [2021-06-05 22:14:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:05,221 INFO L482 AbstractCegarLoop]: Abstraction has 194 states and 562 transitions. [2021-06-05 22:14:05,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 562 transitions. [2021-06-05 22:14:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:05,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:05,221 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:05,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 22:14:05,222 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2074864322, now seen corresponding path program 59 times [2021-06-05 22:14:05,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:05,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960810991] [2021-06-05 22:14:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:05,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:05,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960810991] [2021-06-05 22:14:05,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960810991] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:05,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:05,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:05,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495820076] [2021-06-05 22:14:05,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:05,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:05,275 INFO L87 Difference]: Start difference. First operand 194 states and 562 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:05,445 INFO L93 Difference]: Finished difference Result 430 states and 1172 transitions. [2021-06-05 22:14:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:05,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:05,446 INFO L225 Difference]: With dead ends: 430 [2021-06-05 22:14:05,446 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 22:14:05,446 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 120.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 22:14:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 196. [2021-06-05 22:14:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.928205128205128) internal successors, (571), 195 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 571 transitions. [2021-06-05 22:14:05,452 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 571 transitions. Word has length 17 [2021-06-05 22:14:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:05,452 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 571 transitions. [2021-06-05 22:14:05,452 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 571 transitions. [2021-06-05 22:14:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:05,452 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:05,452 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:05,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 22:14:05,453 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash -934580486, now seen corresponding path program 60 times [2021-06-05 22:14:05,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:05,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683119598] [2021-06-05 22:14:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:05,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:05,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683119598] [2021-06-05 22:14:05,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683119598] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:05,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:05,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:05,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130215035] [2021-06-05 22:14:05,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:05,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:05,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:05,504 INFO L87 Difference]: Start difference. First operand 196 states and 571 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:05,636 INFO L93 Difference]: Finished difference Result 409 states and 1134 transitions. [2021-06-05 22:14:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:05,637 INFO L225 Difference]: With dead ends: 409 [2021-06-05 22:14:05,637 INFO L226 Difference]: Without dead ends: 394 [2021-06-05 22:14:05,638 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 112.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-06-05 22:14:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 192. [2021-06-05 22:14:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.905759162303665) internal successors, (555), 191 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 22:14:05,641 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 22:14:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:05,642 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 22:14:05,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 22:14:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:05,642 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:05,642 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:05,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-05 22:14:05,642 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:05,643 INFO L82 PathProgramCache]: Analyzing trace with hash -674451760, now seen corresponding path program 61 times [2021-06-05 22:14:05,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:05,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792121454] [2021-06-05 22:14:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:05,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:05,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792121454] [2021-06-05 22:14:05,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792121454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:05,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:05,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:05,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930313288] [2021-06-05 22:14:05,688 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:05,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:05,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:05,689 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:05,815 INFO L93 Difference]: Finished difference Result 328 states and 903 transitions. [2021-06-05 22:14:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:05,816 INFO L225 Difference]: With dead ends: 328 [2021-06-05 22:14:05,816 INFO L226 Difference]: Without dead ends: 313 [2021-06-05 22:14:05,817 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-06-05 22:14:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 197. [2021-06-05 22:14:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.913265306122449) internal successors, (571), 196 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 571 transitions. [2021-06-05 22:14:05,821 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 571 transitions. Word has length 17 [2021-06-05 22:14:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:05,821 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 571 transitions. [2021-06-05 22:14:05,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 571 transitions. [2021-06-05 22:14:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:05,821 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:05,822 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:05,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-05 22:14:05,822 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1924375180, now seen corresponding path program 62 times [2021-06-05 22:14:05,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:05,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555829289] [2021-06-05 22:14:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:05,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:05,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555829289] [2021-06-05 22:14:05,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555829289] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:05,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:05,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:05,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934202419] [2021-06-05 22:14:05,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:05,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:05,878 INFO L87 Difference]: Start difference. First operand 197 states and 571 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:06,054 INFO L93 Difference]: Finished difference Result 357 states and 963 transitions. [2021-06-05 22:14:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:06,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:06,057 INFO L225 Difference]: With dead ends: 357 [2021-06-05 22:14:06,058 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 22:14:06,058 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 135.8ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 22:14:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2021-06-05 22:14:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9292929292929295) internal successors, (580), 198 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 22:14:06,063 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 22:14:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:06,063 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 22:14:06,063 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 22:14:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:06,064 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:06,064 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:06,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 22:14:06,064 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1151956756, now seen corresponding path program 63 times [2021-06-05 22:14:06,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:06,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832530419] [2021-06-05 22:14:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:06,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:06,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832530419] [2021-06-05 22:14:06,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832530419] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:06,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:06,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:06,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263304856] [2021-06-05 22:14:06,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:06,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:06,129 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:06,273 INFO L93 Difference]: Finished difference Result 334 states and 918 transitions. [2021-06-05 22:14:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:06,274 INFO L225 Difference]: With dead ends: 334 [2021-06-05 22:14:06,274 INFO L226 Difference]: Without dead ends: 319 [2021-06-05 22:14:06,274 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 136.2ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-06-05 22:14:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 195. [2021-06-05 22:14:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9072164948453607) internal successors, (564), 194 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 22:14:06,277 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 22:14:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:06,278 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 22:14:06,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 22:14:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:06,278 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:06,278 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:06,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-05 22:14:06,279 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 263807996, now seen corresponding path program 64 times [2021-06-05 22:14:06,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:06,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335801975] [2021-06-05 22:14:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:06,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:06,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335801975] [2021-06-05 22:14:06,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335801975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:06,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:06,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:06,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212437325] [2021-06-05 22:14:06,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:06,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:06,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:06,337 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:06,474 INFO L93 Difference]: Finished difference Result 349 states and 945 transitions. [2021-06-05 22:14:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:06,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:06,475 INFO L225 Difference]: With dead ends: 349 [2021-06-05 22:14:06,475 INFO L226 Difference]: Without dead ends: 334 [2021-06-05 22:14:06,475 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 113.8ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-06-05 22:14:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 199. [2021-06-05 22:14:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9292929292929295) internal successors, (580), 198 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 22:14:06,479 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 22:14:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:06,479 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 22:14:06,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 22:14:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:06,480 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:06,480 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:06,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-05 22:14:06,480 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:06,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash -954827364, now seen corresponding path program 65 times [2021-06-05 22:14:06,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:06,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817629183] [2021-06-05 22:14:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:06,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:06,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817629183] [2021-06-05 22:14:06,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817629183] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:06,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:06,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:06,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989262343] [2021-06-05 22:14:06,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:06,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:06,535 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:06,683 INFO L93 Difference]: Finished difference Result 353 states and 951 transitions. [2021-06-05 22:14:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:06,684 INFO L225 Difference]: With dead ends: 353 [2021-06-05 22:14:06,684 INFO L226 Difference]: Without dead ends: 338 [2021-06-05 22:14:06,684 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 134.5ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-06-05 22:14:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 197. [2021-06-05 22:14:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.913265306122449) internal successors, (571), 196 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 571 transitions. [2021-06-05 22:14:06,688 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 571 transitions. Word has length 17 [2021-06-05 22:14:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:06,688 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 571 transitions. [2021-06-05 22:14:06,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 571 transitions. [2021-06-05 22:14:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:06,688 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:06,688 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:06,689 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-05 22:14:06,689 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 120883792, now seen corresponding path program 66 times [2021-06-05 22:14:06,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:06,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822863772] [2021-06-05 22:14:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:06,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:06,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822863772] [2021-06-05 22:14:06,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822863772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:06,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:06,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:06,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902315257] [2021-06-05 22:14:06,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:06,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:06,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:06,750 INFO L87 Difference]: Start difference. First operand 197 states and 571 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:06,861 INFO L93 Difference]: Finished difference Result 324 states and 891 transitions. [2021-06-05 22:14:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:06,862 INFO L225 Difference]: With dead ends: 324 [2021-06-05 22:14:06,862 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 22:14:06,862 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 22:14:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 195. [2021-06-05 22:14:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9072164948453607) internal successors, (564), 194 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 22:14:06,867 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 22:14:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:06,867 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 22:14:06,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 22:14:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:06,867 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:06,867 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:06,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-05 22:14:06,867 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 409284692, now seen corresponding path program 67 times [2021-06-05 22:14:06,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:06,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534759] [2021-06-05 22:14:06,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:06,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:06,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534759] [2021-06-05 22:14:06,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534759] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:06,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:06,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:06,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506594862] [2021-06-05 22:14:06,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:06,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:06,916 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:07,020 INFO L93 Difference]: Finished difference Result 442 states and 1201 transitions. [2021-06-05 22:14:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:07,022 INFO L225 Difference]: With dead ends: 442 [2021-06-05 22:14:07,022 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 22:14:07,022 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 22:14:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 198. [2021-06-05 22:14:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.9238578680203045) internal successors, (576), 197 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 22:14:07,027 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 22:14:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:07,027 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 22:14:07,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 22:14:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:07,028 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:07,028 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:07,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 22:14:07,028 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -840638728, now seen corresponding path program 68 times [2021-06-05 22:14:07,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:07,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456027958] [2021-06-05 22:14:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:07,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:07,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456027958] [2021-06-05 22:14:07,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456027958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:07,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:07,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:07,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890544044] [2021-06-05 22:14:07,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:07,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:07,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:07,078 INFO L87 Difference]: Start difference. First operand 198 states and 576 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:07,235 INFO L93 Difference]: Finished difference Result 465 states and 1248 transitions. [2021-06-05 22:14:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:07,236 INFO L225 Difference]: With dead ends: 465 [2021-06-05 22:14:07,236 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 22:14:07,236 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 122.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 22:14:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 200. [2021-06-05 22:14:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.9396984924623117) internal successors, (585), 199 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 22:14:07,241 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 22:14:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:07,241 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 22:14:07,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 22:14:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:07,241 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:07,242 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:07,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 22:14:07,242 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2059274088, now seen corresponding path program 69 times [2021-06-05 22:14:07,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:07,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933219199] [2021-06-05 22:14:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:07,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:07,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933219199] [2021-06-05 22:14:07,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933219199] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:07,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:07,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:07,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20867754] [2021-06-05 22:14:07,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:07,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:07,304 INFO L87 Difference]: Start difference. First operand 200 states and 585 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:07,460 INFO L93 Difference]: Finished difference Result 442 states and 1203 transitions. [2021-06-05 22:14:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:07,461 INFO L225 Difference]: With dead ends: 442 [2021-06-05 22:14:07,461 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 22:14:07,461 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 126.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 22:14:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 196. [2021-06-05 22:14:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.917948717948718) internal successors, (569), 195 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 22:14:07,466 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 22:14:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:07,466 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 22:14:07,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 22:14:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:07,467 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:07,467 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:07,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 22:14:07,468 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:07,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:07,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1005390608, now seen corresponding path program 70 times [2021-06-05 22:14:07,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:07,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317671545] [2021-06-05 22:14:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:07,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:07,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317671545] [2021-06-05 22:14:07,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317671545] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:07,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:07,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:07,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100727002] [2021-06-05 22:14:07,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:07,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:07,538 INFO L87 Difference]: Start difference. First operand 196 states and 569 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:07,700 INFO L93 Difference]: Finished difference Result 393 states and 1085 transitions. [2021-06-05 22:14:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:07,701 INFO L225 Difference]: With dead ends: 393 [2021-06-05 22:14:07,701 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 22:14:07,701 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 156.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 22:14:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 199. [2021-06-05 22:14:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9292929292929295) internal successors, (580), 198 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 22:14:07,708 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 22:14:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:07,708 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 22:14:07,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 22:14:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:07,709 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:07,709 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:07,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 22:14:07,709 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 184219092, now seen corresponding path program 71 times [2021-06-05 22:14:07,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:07,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017225725] [2021-06-05 22:14:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:07,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:07,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017225725] [2021-06-05 22:14:07,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017225725] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:07,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:07,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:07,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973361755] [2021-06-05 22:14:07,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:07,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:07,768 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:07,990 INFO L93 Difference]: Finished difference Result 391 states and 1089 transitions. [2021-06-05 22:14:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:07,991 INFO L225 Difference]: With dead ends: 391 [2021-06-05 22:14:07,991 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 22:14:07,991 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 206.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 22:14:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 202. [2021-06-05 22:14:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.955223880597015) internal successors, (594), 201 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 594 transitions. [2021-06-05 22:14:07,995 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 594 transitions. Word has length 17 [2021-06-05 22:14:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:07,995 INFO L482 AbstractCegarLoop]: Abstraction has 202 states and 594 transitions. [2021-06-05 22:14:07,995 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 594 transitions. [2021-06-05 22:14:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:07,995 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:07,995 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:07,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 22:14:07,996 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1514501296, now seen corresponding path program 72 times [2021-06-05 22:14:07,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:07,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587657911] [2021-06-05 22:14:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:08,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:08,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587657911] [2021-06-05 22:14:08,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587657911] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:08,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:08,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:08,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679193737] [2021-06-05 22:14:08,054 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:08,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:08,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:08,055 INFO L87 Difference]: Start difference. First operand 202 states and 594 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:08,252 INFO L93 Difference]: Finished difference Result 368 states and 1044 transitions. [2021-06-05 22:14:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:08,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:08,257 INFO L225 Difference]: With dead ends: 368 [2021-06-05 22:14:08,257 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 22:14:08,257 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 22:14:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 196. [2021-06-05 22:14:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.917948717948718) internal successors, (569), 195 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 22:14:08,261 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 22:14:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:08,262 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 22:14:08,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 22:14:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:08,262 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:08,262 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:08,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 22:14:08,263 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash 81063412, now seen corresponding path program 73 times [2021-06-05 22:14:08,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:08,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502564511] [2021-06-05 22:14:08,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:08,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:08,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502564511] [2021-06-05 22:14:08,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502564511] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:08,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:08,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:08,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038501213] [2021-06-05 22:14:08,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:08,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:08,313 INFO L87 Difference]: Start difference. First operand 196 states and 569 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:08,458 INFO L93 Difference]: Finished difference Result 445 states and 1229 transitions. [2021-06-05 22:14:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:08,459 INFO L225 Difference]: With dead ends: 445 [2021-06-05 22:14:08,459 INFO L226 Difference]: Without dead ends: 430 [2021-06-05 22:14:08,460 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-06-05 22:14:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 199. [2021-06-05 22:14:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9494949494949494) internal successors, (584), 198 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 22:14:08,465 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 22:14:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:08,465 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 22:14:08,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 22:14:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:08,466 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:08,466 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:08,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 22:14:08,466 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1137571948, now seen corresponding path program 74 times [2021-06-05 22:14:08,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:08,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397866806] [2021-06-05 22:14:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:08,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:08,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397866806] [2021-06-05 22:14:08,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397866806] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:08,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:08,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:08,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744928038] [2021-06-05 22:14:08,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:08,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:08,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:08,521 INFO L87 Difference]: Start difference. First operand 199 states and 584 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:08,703 INFO L93 Difference]: Finished difference Result 443 states and 1222 transitions. [2021-06-05 22:14:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:08,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:08,704 INFO L225 Difference]: With dead ends: 443 [2021-06-05 22:14:08,704 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 22:14:08,704 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 134.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 22:14:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 197. [2021-06-05 22:14:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.933673469387755) internal successors, (575), 196 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 22:14:08,709 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 22:14:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:08,709 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 22:14:08,709 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 22:14:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:08,710 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:08,710 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:08,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-05 22:14:08,710 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1070123960, now seen corresponding path program 75 times [2021-06-05 22:14:08,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:08,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54455161] [2021-06-05 22:14:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:08,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:08,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54455161] [2021-06-05 22:14:08,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54455161] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:08,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:08,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:08,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455836434] [2021-06-05 22:14:08,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:08,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:08,767 INFO L87 Difference]: Start difference. First operand 197 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:08,921 INFO L93 Difference]: Finished difference Result 437 states and 1201 transitions. [2021-06-05 22:14:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:08,921 INFO L225 Difference]: With dead ends: 437 [2021-06-05 22:14:08,922 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 22:14:08,922 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 22:14:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 200. [2021-06-05 22:14:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.959798994974874) internal successors, (589), 199 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 589 transitions. [2021-06-05 22:14:08,925 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 589 transitions. Word has length 17 [2021-06-05 22:14:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:08,925 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 589 transitions. [2021-06-05 22:14:08,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 589 transitions. [2021-06-05 22:14:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:08,926 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:08,926 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:08,926 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-05 22:14:08,926 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash -100065036, now seen corresponding path program 76 times [2021-06-05 22:14:08,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:08,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28176314] [2021-06-05 22:14:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:08,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:08,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28176314] [2021-06-05 22:14:08,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28176314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:08,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:08,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:08,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136529715] [2021-06-05 22:14:08,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:08,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:08,993 INFO L87 Difference]: Start difference. First operand 200 states and 589 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:09,152 INFO L93 Difference]: Finished difference Result 421 states and 1178 transitions. [2021-06-05 22:14:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:09,153 INFO L225 Difference]: With dead ends: 421 [2021-06-05 22:14:09,153 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 22:14:09,153 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 22:14:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 197. [2021-06-05 22:14:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.933673469387755) internal successors, (575), 196 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 22:14:09,157 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 22:14:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:09,157 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 22:14:09,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 22:14:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:09,157 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:09,157 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:09,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-05 22:14:09,157 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash -117002088, now seen corresponding path program 77 times [2021-06-05 22:14:09,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:09,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713045101] [2021-06-05 22:14:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:09,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:09,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713045101] [2021-06-05 22:14:09,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713045101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:09,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:09,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:09,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9169182] [2021-06-05 22:14:09,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:09,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:09,215 INFO L87 Difference]: Start difference. First operand 197 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:09,353 INFO L93 Difference]: Finished difference Result 405 states and 1129 transitions. [2021-06-05 22:14:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:09,353 INFO L225 Difference]: With dead ends: 405 [2021-06-05 22:14:09,353 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 22:14:09,354 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 22:14:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 199. [2021-06-05 22:14:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9494949494949494) internal successors, (584), 198 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 22:14:09,357 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 22:14:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:09,357 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 22:14:09,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 22:14:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:09,357 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:09,357 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:09,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-05 22:14:09,358 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1023281748, now seen corresponding path program 78 times [2021-06-05 22:14:09,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:09,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845090484] [2021-06-05 22:14:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:09,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:09,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845090484] [2021-06-05 22:14:09,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845090484] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:09,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:09,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:09,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726739605] [2021-06-05 22:14:09,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:09,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:09,412 INFO L87 Difference]: Start difference. First operand 199 states and 584 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:09,587 INFO L93 Difference]: Finished difference Result 384 states and 1091 transitions. [2021-06-05 22:14:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:09,588 INFO L225 Difference]: With dead ends: 384 [2021-06-05 22:14:09,588 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 22:14:09,588 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 123.0ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 22:14:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 195. [2021-06-05 22:14:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9072164948453607) internal successors, (564), 194 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 22:14:09,599 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 22:14:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:09,599 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 22:14:09,599 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 22:14:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:09,599 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:09,599 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:09,599 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-05 22:14:09,600 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1228196736, now seen corresponding path program 79 times [2021-06-05 22:14:09,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:09,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342999611] [2021-06-05 22:14:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:09,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:09,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342999611] [2021-06-05 22:14:09,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342999611] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:09,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:09,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:09,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505207527] [2021-06-05 22:14:09,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:09,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:09,660 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:09,808 INFO L93 Difference]: Finished difference Result 425 states and 1163 transitions. [2021-06-05 22:14:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:09,809 INFO L225 Difference]: With dead ends: 425 [2021-06-05 22:14:09,809 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 22:14:09,809 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 106.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 22:14:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 200. [2021-06-05 22:14:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.9396984924623117) internal successors, (585), 199 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 22:14:09,812 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 22:14:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:09,812 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 22:14:09,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 22:14:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:09,813 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:09,813 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:09,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-05 22:14:09,813 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1848135200, now seen corresponding path program 80 times [2021-06-05 22:14:09,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:09,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672569057] [2021-06-05 22:14:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:09,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:09,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672569057] [2021-06-05 22:14:09,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672569057] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:09,875 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:09,875 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:09,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286175185] [2021-06-05 22:14:09,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:09,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:09,876 INFO L87 Difference]: Start difference. First operand 200 states and 585 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:10,010 INFO L93 Difference]: Finished difference Result 429 states and 1169 transitions. [2021-06-05 22:14:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:10,011 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:14:10,011 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:14:10,011 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:14:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 198. [2021-06-05 22:14:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.9238578680203045) internal successors, (576), 197 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 22:14:10,015 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 22:14:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:10,015 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 22:14:10,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 22:14:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:10,016 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:10,016 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:10,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-05 22:14:10,016 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1371120940, now seen corresponding path program 81 times [2021-06-05 22:14:10,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:10,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949975437] [2021-06-05 22:14:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:10,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:10,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949975437] [2021-06-05 22:14:10,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949975437] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:10,069 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:10,069 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:10,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605543610] [2021-06-05 22:14:10,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:10,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:10,070 INFO L87 Difference]: Start difference. First operand 198 states and 576 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:10,175 INFO L93 Difference]: Finished difference Result 429 states and 1163 transitions. [2021-06-05 22:14:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:10,176 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:14:10,176 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:14:10,177 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:14:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 196. [2021-06-05 22:14:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.917948717948718) internal successors, (569), 195 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 22:14:10,181 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 22:14:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:10,181 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 22:14:10,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 22:14:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:10,182 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:10,182 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:10,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 22:14:10,182 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1608879492, now seen corresponding path program 82 times [2021-06-05 22:14:10,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:10,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964330984] [2021-06-05 22:14:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:10,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:10,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964330984] [2021-06-05 22:14:10,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964330984] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:10,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:10,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:10,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89708864] [2021-06-05 22:14:10,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:10,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:10,237 INFO L87 Difference]: Start difference. First operand 196 states and 569 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:10,377 INFO L93 Difference]: Finished difference Result 451 states and 1224 transitions. [2021-06-05 22:14:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:10,378 INFO L225 Difference]: With dead ends: 451 [2021-06-05 22:14:10,378 INFO L226 Difference]: Without dead ends: 436 [2021-06-05 22:14:10,378 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-06-05 22:14:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 199. [2021-06-05 22:14:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9494949494949494) internal successors, (584), 198 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 22:14:10,381 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 22:14:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:10,381 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 22:14:10,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 22:14:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:10,382 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:10,382 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:10,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 22:14:10,382 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1467452444, now seen corresponding path program 83 times [2021-06-05 22:14:10,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:10,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039506186] [2021-06-05 22:14:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:10,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:10,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039506186] [2021-06-05 22:14:10,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039506186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:10,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:10,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:10,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596244453] [2021-06-05 22:14:10,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:10,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:10,435 INFO L87 Difference]: Start difference. First operand 199 states and 584 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:10,605 INFO L93 Difference]: Finished difference Result 455 states and 1230 transitions. [2021-06-05 22:14:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:10,606 INFO L225 Difference]: With dead ends: 455 [2021-06-05 22:14:10,606 INFO L226 Difference]: Without dead ends: 440 [2021-06-05 22:14:10,606 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-06-05 22:14:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 197. [2021-06-05 22:14:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.933673469387755) internal successors, (575), 196 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 22:14:10,611 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 22:14:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:10,611 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 22:14:10,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 22:14:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:10,611 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:10,611 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:10,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-05 22:14:10,612 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash -619818944, now seen corresponding path program 84 times [2021-06-05 22:14:10,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:10,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675365088] [2021-06-05 22:14:10,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:10,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:10,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675365088] [2021-06-05 22:14:10,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675365088] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:10,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:10,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:10,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484073435] [2021-06-05 22:14:10,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:10,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:10,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:10,666 INFO L87 Difference]: Start difference. First operand 197 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:10,848 INFO L93 Difference]: Finished difference Result 422 states and 1158 transitions. [2021-06-05 22:14:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:10,849 INFO L225 Difference]: With dead ends: 422 [2021-06-05 22:14:10,849 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 22:14:10,849 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 142.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 22:14:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 200. [2021-06-05 22:14:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.959798994974874) internal successors, (589), 199 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 589 transitions. [2021-06-05 22:14:10,853 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 589 transitions. Word has length 17 [2021-06-05 22:14:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:10,853 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 589 transitions. [2021-06-05 22:14:10,853 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 589 transitions. [2021-06-05 22:14:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:10,855 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:10,855 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:10,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 22:14:10,855 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1790007940, now seen corresponding path program 85 times [2021-06-05 22:14:10,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:10,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523982778] [2021-06-05 22:14:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:10,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:10,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523982778] [2021-06-05 22:14:10,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523982778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:10,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:10,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:10,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937147594] [2021-06-05 22:14:10,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:10,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:10,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:10,909 INFO L87 Difference]: Start difference. First operand 200 states and 589 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:11,097 INFO L93 Difference]: Finished difference Result 406 states and 1135 transitions. [2021-06-05 22:14:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:11,098 INFO L225 Difference]: With dead ends: 406 [2021-06-05 22:14:11,098 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 22:14:11,098 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 149.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 22:14:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 197. [2021-06-05 22:14:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.933673469387755) internal successors, (575), 196 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 22:14:11,104 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 22:14:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:11,105 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 22:14:11,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 22:14:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:11,106 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:11,106 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:11,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 22:14:11,106 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1806944992, now seen corresponding path program 86 times [2021-06-05 22:14:11,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:11,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052371783] [2021-06-05 22:14:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:11,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:11,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052371783] [2021-06-05 22:14:11,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052371783] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:11,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:11,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:11,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727921834] [2021-06-05 22:14:11,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:11,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:11,161 INFO L87 Difference]: Start difference. First operand 197 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:11,329 INFO L93 Difference]: Finished difference Result 440 states and 1205 transitions. [2021-06-05 22:14:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:11,330 INFO L225 Difference]: With dead ends: 440 [2021-06-05 22:14:11,330 INFO L226 Difference]: Without dead ends: 425 [2021-06-05 22:14:11,330 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 128.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-06-05 22:14:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 199. [2021-06-05 22:14:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.9494949494949494) internal successors, (584), 198 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 22:14:11,334 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 22:14:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:11,335 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 22:14:11,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 22:14:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:11,335 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:11,335 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:11,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 22:14:11,335 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash -666661156, now seen corresponding path program 87 times [2021-06-05 22:14:11,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:11,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459454730] [2021-06-05 22:14:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:11,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:11,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459454730] [2021-06-05 22:14:11,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459454730] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:11,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:11,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:11,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807046345] [2021-06-05 22:14:11,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:11,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:11,380 INFO L87 Difference]: Start difference. First operand 199 states and 584 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:11,510 INFO L93 Difference]: Finished difference Result 419 states and 1167 transitions. [2021-06-05 22:14:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:11,511 INFO L225 Difference]: With dead ends: 419 [2021-06-05 22:14:11,511 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:14:11,511 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 95.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:14:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 196. [2021-06-05 22:14:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.917948717948718) internal successors, (569), 195 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 22:14:11,514 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 22:14:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:11,514 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 22:14:11,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 22:14:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:11,515 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:11,515 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:11,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 22:14:11,515 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 201773648, now seen corresponding path program 88 times [2021-06-05 22:14:11,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:11,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337007055] [2021-06-05 22:14:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:11,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:11,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337007055] [2021-06-05 22:14:11,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337007055] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:11,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:11,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:11,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979181042] [2021-06-05 22:14:11,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:11,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:11,569 INFO L87 Difference]: Start difference. First operand 196 states and 569 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:11,681 INFO L93 Difference]: Finished difference Result 382 states and 1052 transitions. [2021-06-05 22:14:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:11,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:11,682 INFO L225 Difference]: With dead ends: 382 [2021-06-05 22:14:11,682 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 22:14:11,682 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 22:14:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 198. [2021-06-05 22:14:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.9238578680203045) internal successors, (576), 197 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 22:14:11,685 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 22:14:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:11,685 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 22:14:11,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 22:14:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:11,685 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:11,685 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:11,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 22:14:11,686 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1159324884, now seen corresponding path program 89 times [2021-06-05 22:14:11,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:11,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450260803] [2021-06-05 22:14:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:11,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:11,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450260803] [2021-06-05 22:14:11,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450260803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:11,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:11,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:11,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228806828] [2021-06-05 22:14:11,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:11,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:11,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:11,742 INFO L87 Difference]: Start difference. First operand 198 states and 576 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:11,900 INFO L93 Difference]: Finished difference Result 383 states and 1063 transitions. [2021-06-05 22:14:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:11,901 INFO L225 Difference]: With dead ends: 383 [2021-06-05 22:14:11,901 INFO L226 Difference]: Without dead ends: 368 [2021-06-05 22:14:11,901 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 125.3ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-06-05 22:14:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 200. [2021-06-05 22:14:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.9396984924623117) internal successors, (585), 199 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 22:14:11,905 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 22:14:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:11,905 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 22:14:11,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 22:14:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 22:14:11,906 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:11,906 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:11,906 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 22:14:11,906 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1995358576, now seen corresponding path program 90 times [2021-06-05 22:14:11,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:11,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936487047] [2021-06-05 22:14:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:11,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:11,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936487047] [2021-06-05 22:14:11,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936487047] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:11,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:11,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:11,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131978479] [2021-06-05 22:14:11,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:11,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:11,958 INFO L87 Difference]: Start difference. First operand 200 states and 585 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:12,109 INFO L93 Difference]: Finished difference Result 362 states and 1025 transitions. [2021-06-05 22:14:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:12,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 22:14:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:12,109 INFO L225 Difference]: With dead ends: 362 [2021-06-05 22:14:12,110 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 22:14:12,110 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 118.1ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 22:14:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 195. [2021-06-05 22:14:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.9072164948453607) internal successors, (564), 194 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 22:14:12,115 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 22:14:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:12,115 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 22:14:12,116 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 22:14:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:12,116 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:12,116 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:12,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 22:14:12,116 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1106194689, now seen corresponding path program 1 times [2021-06-05 22:14:12,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:12,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188276154] [2021-06-05 22:14:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:12,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:12,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188276154] [2021-06-05 22:14:12,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188276154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:12,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808759022] [2021-06-05 22:14:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:12,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:12,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:12,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808759022] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:12,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:12,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:12,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551046869] [2021-06-05 22:14:12,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:12,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:12,471 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:12,645 INFO L93 Difference]: Finished difference Result 363 states and 1031 transitions. [2021-06-05 22:14:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:12,655 INFO L225 Difference]: With dead ends: 363 [2021-06-05 22:14:12,655 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 22:14:12,655 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 172.9ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 22:14:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 208. [2021-06-05 22:14:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9613526570048307) internal successors, (613), 207 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 22:14:12,662 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 18 [2021-06-05 22:14:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:12,662 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 22:14:12,662 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 22:14:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:12,663 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:12,663 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:12,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2021-06-05 22:14:12,881 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1981219535, now seen corresponding path program 2 times [2021-06-05 22:14:12,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:12,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076338827] [2021-06-05 22:14:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:12,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:12,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076338827] [2021-06-05 22:14:12,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076338827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:12,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983715414] [2021-06-05 22:14:12,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:12,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:13,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:13,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:13,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:13,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983715414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:13,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:13,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:13,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721053514] [2021-06-05 22:14:13,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:13,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:13,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:13,104 INFO L87 Difference]: Start difference. First operand 208 states and 613 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:13,271 INFO L93 Difference]: Finished difference Result 405 states and 1139 transitions. [2021-06-05 22:14:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:13,273 INFO L225 Difference]: With dead ends: 405 [2021-06-05 22:14:13,273 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 22:14:13,273 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 163.3ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 22:14:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 214. [2021-06-05 22:14:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.004694835680751) internal successors, (640), 213 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2021-06-05 22:14:13,280 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 18 [2021-06-05 22:14:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:13,280 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2021-06-05 22:14:13,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2021-06-05 22:14:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:13,281 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:13,281 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:13,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:13,504 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:13,504 INFO L82 PathProgramCache]: Analyzing trace with hash 615027373, now seen corresponding path program 3 times [2021-06-05 22:14:13,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:13,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010145637] [2021-06-05 22:14:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:13,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:13,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010145637] [2021-06-05 22:14:13,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010145637] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:13,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644287163] [2021-06-05 22:14:13,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:13,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:13,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:13,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:13,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:13,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644287163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:13,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:13,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:13,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526484199] [2021-06-05 22:14:13,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:13,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:13,758 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:13,976 INFO L93 Difference]: Finished difference Result 384 states and 1093 transitions. [2021-06-05 22:14:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:13,977 INFO L225 Difference]: With dead ends: 384 [2021-06-05 22:14:13,977 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 22:14:13,978 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 180.1ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 22:14:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 206. [2021-06-05 22:14:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.9658536585365853) internal successors, (608), 205 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 608 transitions. [2021-06-05 22:14:13,982 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 608 transitions. Word has length 18 [2021-06-05 22:14:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:13,982 INFO L482 AbstractCegarLoop]: Abstraction has 206 states and 608 transitions. [2021-06-05 22:14:13,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 608 transitions. [2021-06-05 22:14:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:13,983 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:13,983 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:14,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 22:14:14,205 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1804293443, now seen corresponding path program 4 times [2021-06-05 22:14:14,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:14,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323804253] [2021-06-05 22:14:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:14,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:14,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323804253] [2021-06-05 22:14:14,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323804253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:14,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257714119] [2021-06-05 22:14:14,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:14,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:14,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:14,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:14,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:14,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257714119] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:14,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:14,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:14,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467275720] [2021-06-05 22:14:14,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:14,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:14,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:14,372 INFO L87 Difference]: Start difference. First operand 206 states and 608 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:14,527 INFO L93 Difference]: Finished difference Result 395 states and 1126 transitions. [2021-06-05 22:14:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:14,528 INFO L225 Difference]: With dead ends: 395 [2021-06-05 22:14:14,528 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 22:14:14,528 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 149.7ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 22:14:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 212. [2021-06-05 22:14:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.990521327014218) internal successors, (631), 211 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2021-06-05 22:14:14,533 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 18 [2021-06-05 22:14:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:14,533 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2021-06-05 22:14:14,533 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2021-06-05 22:14:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:14,533 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:14,533 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:14,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2021-06-05 22:14:14,751 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1778517959, now seen corresponding path program 5 times [2021-06-05 22:14:14,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:14,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239050163] [2021-06-05 22:14:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:14,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:14,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239050163] [2021-06-05 22:14:14,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239050163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:14,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248442517] [2021-06-05 22:14:14,803 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:14,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:14,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:14,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:14,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:14,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248442517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:14,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:14,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:14,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113053475] [2021-06-05 22:14:14,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:14,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:14,924 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:15,112 INFO L93 Difference]: Finished difference Result 437 states and 1235 transitions. [2021-06-05 22:14:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:15,114 INFO L225 Difference]: With dead ends: 437 [2021-06-05 22:14:15,114 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 22:14:15,114 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 163.0ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 22:14:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 216. [2021-06-05 22:14:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.027906976744186) internal successors, (651), 215 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 651 transitions. [2021-06-05 22:14:15,119 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 651 transitions. Word has length 18 [2021-06-05 22:14:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:15,119 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 651 transitions. [2021-06-05 22:14:15,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 651 transitions. [2021-06-05 22:14:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:15,119 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:15,119 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:15,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2021-06-05 22:14:15,342 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 79797571, now seen corresponding path program 6 times [2021-06-05 22:14:15,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:15,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737102604] [2021-06-05 22:14:15,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:15,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:15,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737102604] [2021-06-05 22:14:15,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737102604] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:15,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293355979] [2021-06-05 22:14:15,395 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:15,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:15,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:15,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:15,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:15,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293355979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:15,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:15,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:15,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106199600] [2021-06-05 22:14:15,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:15,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:15,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:15,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:15,506 INFO L87 Difference]: Start difference. First operand 216 states and 651 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:15,653 INFO L93 Difference]: Finished difference Result 408 states and 1169 transitions. [2021-06-05 22:14:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:15,654 INFO L225 Difference]: With dead ends: 408 [2021-06-05 22:14:15,654 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 22:14:15,654 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 126.9ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 22:14:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 202. [2021-06-05 22:14:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 3.0049751243781095) internal successors, (604), 201 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2021-06-05 22:14:15,659 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 18 [2021-06-05 22:14:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:15,659 INFO L482 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2021-06-05 22:14:15,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2021-06-05 22:14:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:15,659 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:15,660 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:15,883 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:15,883 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 948617417, now seen corresponding path program 1 times [2021-06-05 22:14:15,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:15,884 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052408041] [2021-06-05 22:14:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:15,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:15,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052408041] [2021-06-05 22:14:15,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052408041] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:15,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:15,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:15,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572385475] [2021-06-05 22:14:15,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:15,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:15,948 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:16,045 INFO L93 Difference]: Finished difference Result 424 states and 1195 transitions. [2021-06-05 22:14:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:16,047 INFO L225 Difference]: With dead ends: 424 [2021-06-05 22:14:16,047 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 22:14:16,047 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 22:14:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 252. [2021-06-05 22:14:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.9322709163346614) internal successors, (736), 251 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 736 transitions. [2021-06-05 22:14:16,051 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 736 transitions. Word has length 18 [2021-06-05 22:14:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:16,051 INFO L482 AbstractCegarLoop]: Abstraction has 252 states and 736 transitions. [2021-06-05 22:14:16,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 736 transitions. [2021-06-05 22:14:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:16,052 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:16,052 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:16,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-05 22:14:16,052 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash 864569794, now seen corresponding path program 1 times [2021-06-05 22:14:16,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:16,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742807233] [2021-06-05 22:14:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:16,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:16,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742807233] [2021-06-05 22:14:16,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742807233] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:16,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:16,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:16,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592142945] [2021-06-05 22:14:16,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:16,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:16,135 INFO L87 Difference]: Start difference. First operand 252 states and 736 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:16,226 INFO L93 Difference]: Finished difference Result 445 states and 1245 transitions. [2021-06-05 22:14:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:16,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:16,227 INFO L225 Difference]: With dead ends: 445 [2021-06-05 22:14:16,227 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 22:14:16,227 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 22:14:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2021-06-05 22:14:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 2.921641791044776) internal successors, (783), 268 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 783 transitions. [2021-06-05 22:14:16,234 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 783 transitions. Word has length 18 [2021-06-05 22:14:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:16,234 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 783 transitions. [2021-06-05 22:14:16,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 783 transitions. [2021-06-05 22:14:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:16,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:16,235 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:16,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-06-05 22:14:16,235 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -966424801, now seen corresponding path program 7 times [2021-06-05 22:14:16,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:16,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182788190] [2021-06-05 22:14:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:16,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:16,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182788190] [2021-06-05 22:14:16,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182788190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:16,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997409838] [2021-06-05 22:14:16,284 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:16,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:16,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:16,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997409838] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:16,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:16,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:16,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379990336] [2021-06-05 22:14:16,414 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:16,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:16,415 INFO L87 Difference]: Start difference. First operand 269 states and 783 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:16,565 INFO L93 Difference]: Finished difference Result 563 states and 1578 transitions. [2021-06-05 22:14:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:16,567 INFO L225 Difference]: With dead ends: 563 [2021-06-05 22:14:16,567 INFO L226 Difference]: Without dead ends: 544 [2021-06-05 22:14:16,567 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 149.3ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-06-05 22:14:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 278. [2021-06-05 22:14:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.963898916967509) internal successors, (821), 277 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 821 transitions. [2021-06-05 22:14:16,573 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 821 transitions. Word has length 18 [2021-06-05 22:14:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:16,573 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 821 transitions. [2021-06-05 22:14:16,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 821 transitions. [2021-06-05 22:14:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:16,573 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:16,573 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:16,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2021-06-05 22:14:16,797 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 241128271, now seen corresponding path program 8 times [2021-06-05 22:14:16,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:16,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328794669] [2021-06-05 22:14:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:16,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:16,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328794669] [2021-06-05 22:14:16,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328794669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:16,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231900984] [2021-06-05 22:14:16,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:16,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:16,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:16,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:16,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:16,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231900984] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:16,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:16,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:16,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355530871] [2021-06-05 22:14:16,977 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:16,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:16,978 INFO L87 Difference]: Start difference. First operand 278 states and 821 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:17,105 INFO L93 Difference]: Finished difference Result 539 states and 1539 transitions. [2021-06-05 22:14:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:17,106 INFO L225 Difference]: With dead ends: 539 [2021-06-05 22:14:17,107 INFO L226 Difference]: Without dead ends: 520 [2021-06-05 22:14:17,107 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 112.3ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-06-05 22:14:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 282. [2021-06-05 22:14:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.99288256227758) internal successors, (841), 281 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 841 transitions. [2021-06-05 22:14:17,113 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 841 transitions. Word has length 18 [2021-06-05 22:14:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:17,113 INFO L482 AbstractCegarLoop]: Abstraction has 282 states and 841 transitions. [2021-06-05 22:14:17,113 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 841 transitions. [2021-06-05 22:14:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:17,113 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:17,113 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:17,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-06-05 22:14:17,329 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1457592117, now seen corresponding path program 9 times [2021-06-05 22:14:17,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:17,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066655554] [2021-06-05 22:14:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:17,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:17,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066655554] [2021-06-05 22:14:17,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066655554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:17,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388825850] [2021-06-05 22:14:17,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:17,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:17,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:17,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:17,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388825850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:17,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:17,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:17,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446939894] [2021-06-05 22:14:17,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:17,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:17,539 INFO L87 Difference]: Start difference. First operand 282 states and 841 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:17,694 INFO L93 Difference]: Finished difference Result 549 states and 1564 transitions. [2021-06-05 22:14:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:17,695 INFO L225 Difference]: With dead ends: 549 [2021-06-05 22:14:17,695 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 22:14:17,695 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 162.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 22:14:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 271. [2021-06-05 22:14:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 2.937037037037037) internal successors, (793), 270 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 793 transitions. [2021-06-05 22:14:17,700 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 793 transitions. Word has length 18 [2021-06-05 22:14:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:17,701 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 793 transitions. [2021-06-05 22:14:17,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 793 transitions. [2021-06-05 22:14:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:17,701 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:17,701 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:17,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:17,917 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1254344866, now seen corresponding path program 2 times [2021-06-05 22:14:17,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:17,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026039999] [2021-06-05 22:14:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:17,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:17,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026039999] [2021-06-05 22:14:17,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026039999] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:17,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:17,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:17,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863287940] [2021-06-05 22:14:17,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:17,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:17,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:17,972 INFO L87 Difference]: Start difference. First operand 271 states and 793 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:18,052 INFO L93 Difference]: Finished difference Result 528 states and 1474 transitions. [2021-06-05 22:14:18,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:18,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:18,053 INFO L225 Difference]: With dead ends: 528 [2021-06-05 22:14:18,053 INFO L226 Difference]: Without dead ends: 457 [2021-06-05 22:14:18,053 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.1ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-06-05 22:14:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 287. [2021-06-05 22:14:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.972027972027972) internal successors, (850), 286 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 850 transitions. [2021-06-05 22:14:18,065 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 850 transitions. Word has length 18 [2021-06-05 22:14:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:18,065 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 850 transitions. [2021-06-05 22:14:18,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 850 transitions. [2021-06-05 22:14:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:18,066 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:18,066 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:18,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-06-05 22:14:18,066 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1663824377, now seen corresponding path program 10 times [2021-06-05 22:14:18,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:18,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755381069] [2021-06-05 22:14:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:18,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:18,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755381069] [2021-06-05 22:14:18,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755381069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:18,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772763422] [2021-06-05 22:14:18,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:18,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:18,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:18,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:18,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:18,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772763422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:18,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:18,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:18,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877978080] [2021-06-05 22:14:18,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:18,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:18,284 INFO L87 Difference]: Start difference. First operand 287 states and 850 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:18,534 INFO L93 Difference]: Finished difference Result 473 states and 1329 transitions. [2021-06-05 22:14:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:18,535 INFO L225 Difference]: With dead ends: 473 [2021-06-05 22:14:18,535 INFO L226 Difference]: Without dead ends: 454 [2021-06-05 22:14:18,535 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 260.2ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-06-05 22:14:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 291. [2021-06-05 22:14:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.9655172413793105) internal successors, (860), 290 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 860 transitions. [2021-06-05 22:14:18,541 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 860 transitions. Word has length 18 [2021-06-05 22:14:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:18,541 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 860 transitions. [2021-06-05 22:14:18,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 860 transitions. [2021-06-05 22:14:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:18,541 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:18,542 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:18,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2021-06-05 22:14:18,759 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1866597709, now seen corresponding path program 11 times [2021-06-05 22:14:18,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:18,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090626001] [2021-06-05 22:14:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:18,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:18,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090626001] [2021-06-05 22:14:18,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090626001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:18,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265421209] [2021-06-05 22:14:18,817 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:18,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:18,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:18,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:18,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:18,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265421209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:18,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:18,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:18,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224500367] [2021-06-05 22:14:18,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:18,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:18,973 INFO L87 Difference]: Start difference. First operand 291 states and 860 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:19,218 INFO L93 Difference]: Finished difference Result 431 states and 1219 transitions. [2021-06-05 22:14:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:19,219 INFO L225 Difference]: With dead ends: 431 [2021-06-05 22:14:19,220 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 22:14:19,220 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 267.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 22:14:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 299. [2021-06-05 22:14:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 2.966442953020134) internal successors, (884), 298 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 884 transitions. [2021-06-05 22:14:19,225 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 884 transitions. Word has length 18 [2021-06-05 22:14:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:19,225 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 884 transitions. [2021-06-05 22:14:19,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 884 transitions. [2021-06-05 22:14:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:19,226 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:19,226 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:19,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 22:14:19,449 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -752125083, now seen corresponding path program 2 times [2021-06-05 22:14:19,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:19,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236402136] [2021-06-05 22:14:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:19,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:19,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236402136] [2021-06-05 22:14:19,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236402136] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:19,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904347069] [2021-06-05 22:14:19,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:19,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:19,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:19,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 22:14:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:19,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904347069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:19,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:19,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:19,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023745427] [2021-06-05 22:14:19,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:19,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:19,611 INFO L87 Difference]: Start difference. First operand 299 states and 884 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:19,758 INFO L93 Difference]: Finished difference Result 471 states and 1313 transitions. [2021-06-05 22:14:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:19,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:19,759 INFO L225 Difference]: With dead ends: 471 [2021-06-05 22:14:19,759 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 22:14:19,759 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 22:14:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 301. [2021-06-05 22:14:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.97) internal successors, (891), 300 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 891 transitions. [2021-06-05 22:14:19,765 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 891 transitions. Word has length 18 [2021-06-05 22:14:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:19,765 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 891 transitions. [2021-06-05 22:14:19,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 891 transitions. [2021-06-05 22:14:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:19,766 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:19,766 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:19,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:19,989 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1213009967, now seen corresponding path program 12 times [2021-06-05 22:14:19,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:19,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531788948] [2021-06-05 22:14:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:20,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:20,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531788948] [2021-06-05 22:14:20,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531788948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:20,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236882712] [2021-06-05 22:14:20,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:20,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:20,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:20,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:20,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:20,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236882712] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:20,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:20,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:20,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666847026] [2021-06-05 22:14:20,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:20,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:20,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:20,198 INFO L87 Difference]: Start difference. First operand 301 states and 891 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:20,409 INFO L93 Difference]: Finished difference Result 417 states and 1196 transitions. [2021-06-05 22:14:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:20,410 INFO L225 Difference]: With dead ends: 417 [2021-06-05 22:14:20,410 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 22:14:20,410 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 22:14:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 295. [2021-06-05 22:14:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 2.9727891156462585) internal successors, (874), 294 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 874 transitions. [2021-06-05 22:14:20,414 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 874 transitions. Word has length 18 [2021-06-05 22:14:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:20,414 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 874 transitions. [2021-06-05 22:14:20,414 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 874 transitions. [2021-06-05 22:14:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:20,415 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:20,415 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:20,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2021-06-05 22:14:20,615 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 303490843, now seen corresponding path program 3 times [2021-06-05 22:14:20,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:20,616 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782556998] [2021-06-05 22:14:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:20,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:20,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782556998] [2021-06-05 22:14:20,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782556998] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:20,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:20,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:20,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743573363] [2021-06-05 22:14:20,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:20,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:20,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:20,669 INFO L87 Difference]: Start difference. First operand 295 states and 874 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:20,870 INFO L93 Difference]: Finished difference Result 441 states and 1242 transitions. [2021-06-05 22:14:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:20,872 INFO L225 Difference]: With dead ends: 441 [2021-06-05 22:14:20,872 INFO L226 Difference]: Without dead ends: 412 [2021-06-05 22:14:20,872 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 159.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-06-05 22:14:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 295. [2021-06-05 22:14:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 2.9659863945578233) internal successors, (872), 294 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 872 transitions. [2021-06-05 22:14:20,877 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 872 transitions. Word has length 18 [2021-06-05 22:14:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:20,877 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 872 transitions. [2021-06-05 22:14:20,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 872 transitions. [2021-06-05 22:14:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:20,878 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:20,878 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:20,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-06-05 22:14:20,878 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1861527460, now seen corresponding path program 3 times [2021-06-05 22:14:20,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:20,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603285577] [2021-06-05 22:14:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:20,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:20,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603285577] [2021-06-05 22:14:20,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603285577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:20,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510012775] [2021-06-05 22:14:20,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:20,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:20,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:20,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:14:20,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:21,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510012775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:21,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:21,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 22:14:21,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435552187] [2021-06-05 22:14:21,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:21,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:21,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:21,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:21,020 INFO L87 Difference]: Start difference. First operand 295 states and 872 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:21,084 INFO L93 Difference]: Finished difference Result 458 states and 1290 transitions. [2021-06-05 22:14:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:21,086 INFO L225 Difference]: With dead ends: 458 [2021-06-05 22:14:21,086 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 22:14:21,086 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 22:14:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 292. [2021-06-05 22:14:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.9690721649484537) internal successors, (864), 291 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 864 transitions. [2021-06-05 22:14:21,091 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 864 transitions. Word has length 18 [2021-06-05 22:14:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:21,092 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 864 transitions. [2021-06-05 22:14:21,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 864 transitions. [2021-06-05 22:14:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:21,092 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:21,092 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:21,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:21,315 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1997185865, now seen corresponding path program 13 times [2021-06-05 22:14:21,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:21,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499286422] [2021-06-05 22:14:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:21,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:21,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499286422] [2021-06-05 22:14:21,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499286422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:21,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302447251] [2021-06-05 22:14:21,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:21,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:21,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:21,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302447251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:21,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:21,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:14:21,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89905879] [2021-06-05 22:14:21,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:21,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:21,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:21,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:21,516 INFO L87 Difference]: Start difference. First operand 292 states and 864 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:21,716 INFO L93 Difference]: Finished difference Result 491 states and 1393 transitions. [2021-06-05 22:14:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:21,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:21,720 INFO L225 Difference]: With dead ends: 491 [2021-06-05 22:14:21,720 INFO L226 Difference]: Without dead ends: 472 [2021-06-05 22:14:21,721 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 195.7ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-06-05 22:14:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 298. [2021-06-05 22:14:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0033670033670035) internal successors, (892), 297 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 892 transitions. [2021-06-05 22:14:21,726 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 892 transitions. Word has length 18 [2021-06-05 22:14:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:21,726 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 892 transitions. [2021-06-05 22:14:21,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 892 transitions. [2021-06-05 22:14:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:21,727 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:21,727 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:21,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:21,941 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1067024689, now seen corresponding path program 14 times [2021-06-05 22:14:21,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:21,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351808306] [2021-06-05 22:14:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:21,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:21,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351808306] [2021-06-05 22:14:21,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351808306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:21,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112374542] [2021-06-05 22:14:21,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:22,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:22,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:22,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:22,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:22,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112374542] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:22,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:22,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:22,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987320513] [2021-06-05 22:14:22,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:22,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:22,126 INFO L87 Difference]: Start difference. First operand 298 states and 892 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:22,344 INFO L93 Difference]: Finished difference Result 479 states and 1353 transitions. [2021-06-05 22:14:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:22,345 INFO L225 Difference]: With dead ends: 479 [2021-06-05 22:14:22,345 INFO L226 Difference]: Without dead ends: 456 [2021-06-05 22:14:22,345 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-06-05 22:14:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 302. [2021-06-05 22:14:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.9833887043189367) internal successors, (898), 301 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 898 transitions. [2021-06-05 22:14:22,349 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 898 transitions. Word has length 18 [2021-06-05 22:14:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:22,350 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 898 transitions. [2021-06-05 22:14:22,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 898 transitions. [2021-06-05 22:14:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:22,350 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:22,350 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:22,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2021-06-05 22:14:22,551 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -435848983, now seen corresponding path program 4 times [2021-06-05 22:14:22,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:22,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635316867] [2021-06-05 22:14:22,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:22,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:22,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635316867] [2021-06-05 22:14:22,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635316867] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:22,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211457983] [2021-06-05 22:14:22,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:22,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:22,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:22,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:14:22,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:22,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211457983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:22,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:22,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-05 22:14:22,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125185449] [2021-06-05 22:14:22,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:14:22,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:14:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:14:22,670 INFO L87 Difference]: Start difference. First operand 302 states and 898 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:22,722 INFO L93 Difference]: Finished difference Result 566 states and 1645 transitions. [2021-06-05 22:14:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:22,722 INFO L225 Difference]: With dead ends: 566 [2021-06-05 22:14:22,723 INFO L226 Difference]: Without dead ends: 517 [2021-06-05 22:14:22,723 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-06-05 22:14:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 311. [2021-06-05 22:14:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.041935483870968) internal successors, (943), 310 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 943 transitions. [2021-06-05 22:14:22,727 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 943 transitions. Word has length 18 [2021-06-05 22:14:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:22,727 INFO L482 AbstractCegarLoop]: Abstraction has 311 states and 943 transitions. [2021-06-05 22:14:22,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 943 transitions. [2021-06-05 22:14:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:22,727 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:22,728 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:22,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:22,928 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1726676173, now seen corresponding path program 15 times [2021-06-05 22:14:22,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:22,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224436991] [2021-06-05 22:14:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:22,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:22,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224436991] [2021-06-05 22:14:22,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224436991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:22,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385934298] [2021-06-05 22:14:22,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:23,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:23,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:23,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:23,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:23,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385934298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:23,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:23,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:23,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412502667] [2021-06-05 22:14:23,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:23,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:23,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:23,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:23,150 INFO L87 Difference]: Start difference. First operand 311 states and 943 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:23,395 INFO L93 Difference]: Finished difference Result 516 states and 1480 transitions. [2021-06-05 22:14:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:23,396 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:23,396 INFO L225 Difference]: With dead ends: 516 [2021-06-05 22:14:23,396 INFO L226 Difference]: Without dead ends: 497 [2021-06-05 22:14:23,397 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 220.0ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-06-05 22:14:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 308. [2021-06-05 22:14:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.0618892508143323) internal successors, (940), 307 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 940 transitions. [2021-06-05 22:14:23,401 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 940 transitions. Word has length 18 [2021-06-05 22:14:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:23,401 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 940 transitions. [2021-06-05 22:14:23,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 940 transitions. [2021-06-05 22:14:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:23,401 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:23,401 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:23,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2021-06-05 22:14:23,603 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1907804621, now seen corresponding path program 16 times [2021-06-05 22:14:23,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:23,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643473338] [2021-06-05 22:14:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:23,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:23,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643473338] [2021-06-05 22:14:23,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643473338] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:23,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301331199] [2021-06-05 22:14:23,663 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:23,704 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:23,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:23,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:23,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:23,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301331199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:23,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:23,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:23,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509894394] [2021-06-05 22:14:23,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:23,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:23,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:23,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:23,809 INFO L87 Difference]: Start difference. First operand 308 states and 940 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:23,944 INFO L93 Difference]: Finished difference Result 497 states and 1451 transitions. [2021-06-05 22:14:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:23,945 INFO L225 Difference]: With dead ends: 497 [2021-06-05 22:14:23,945 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 22:14:23,945 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 22:14:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 304. [2021-06-05 22:14:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.036303630363036) internal successors, (920), 303 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 920 transitions. [2021-06-05 22:14:23,951 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 920 transitions. Word has length 18 [2021-06-05 22:14:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:23,951 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 920 transitions. [2021-06-05 22:14:23,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 920 transitions. [2021-06-05 22:14:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:23,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:23,952 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:24,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:24,165 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash 398774047, now seen corresponding path program 5 times [2021-06-05 22:14:24,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:24,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887282262] [2021-06-05 22:14:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:24,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:24,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887282262] [2021-06-05 22:14:24,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887282262] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:24,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:24,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:24,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208970577] [2021-06-05 22:14:24,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:24,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:24,212 INFO L87 Difference]: Start difference. First operand 304 states and 920 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:24,276 INFO L93 Difference]: Finished difference Result 514 states and 1465 transitions. [2021-06-05 22:14:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:24,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:24,277 INFO L225 Difference]: With dead ends: 514 [2021-06-05 22:14:24,277 INFO L226 Difference]: Without dead ends: 452 [2021-06-05 22:14:24,277 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-06-05 22:14:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 296. [2021-06-05 22:14:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.013559322033898) internal successors, (889), 295 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 889 transitions. [2021-06-05 22:14:24,282 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 889 transitions. Word has length 18 [2021-06-05 22:14:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:24,282 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 889 transitions. [2021-06-05 22:14:24,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 889 transitions. [2021-06-05 22:14:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:24,282 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:24,282 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:24,283 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-06-05 22:14:24,283 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:24,283 INFO L82 PathProgramCache]: Analyzing trace with hash 505869899, now seen corresponding path program 17 times [2021-06-05 22:14:24,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:24,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738783938] [2021-06-05 22:14:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:24,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:24,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738783938] [2021-06-05 22:14:24,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738783938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:24,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464747497] [2021-06-05 22:14:24,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:24,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:24,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:24,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:24,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:24,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464747497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:24,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:24,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:24,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579479228] [2021-06-05 22:14:24,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:24,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:24,488 INFO L87 Difference]: Start difference. First operand 296 states and 889 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:24,749 INFO L93 Difference]: Finished difference Result 450 states and 1288 transitions. [2021-06-05 22:14:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:24,750 INFO L225 Difference]: With dead ends: 450 [2021-06-05 22:14:24,750 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 22:14:24,750 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 251.6ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 22:14:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 304. [2021-06-05 22:14:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.0066006600660065) internal successors, (911), 303 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 911 transitions. [2021-06-05 22:14:24,754 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 911 transitions. Word has length 18 [2021-06-05 22:14:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:24,754 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 911 transitions. [2021-06-05 22:14:24,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 911 transitions. [2021-06-05 22:14:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:24,755 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:24,755 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:24,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:24,955 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:24,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1484427343, now seen corresponding path program 18 times [2021-06-05 22:14:24,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:24,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431778272] [2021-06-05 22:14:24,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:25,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:25,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431778272] [2021-06-05 22:14:25,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431778272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:25,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288708595] [2021-06-05 22:14:25,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:25,037 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:25,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:25,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:25,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:25,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288708595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:25,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:25,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:25,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317506260] [2021-06-05 22:14:25,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:25,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:25,138 INFO L87 Difference]: Start difference. First operand 304 states and 911 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:25,333 INFO L93 Difference]: Finished difference Result 434 states and 1258 transitions. [2021-06-05 22:14:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:25,334 INFO L225 Difference]: With dead ends: 434 [2021-06-05 22:14:25,334 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 22:14:25,334 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 196.9ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 22:14:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 296. [2021-06-05 22:14:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.013559322033898) internal successors, (889), 295 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 889 transitions. [2021-06-05 22:14:25,338 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 889 transitions. Word has length 18 [2021-06-05 22:14:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:25,338 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 889 transitions. [2021-06-05 22:14:25,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 889 transitions. [2021-06-05 22:14:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:25,338 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:25,338 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:25,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2021-06-05 22:14:25,539 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1410127391, now seen corresponding path program 19 times [2021-06-05 22:14:25,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:25,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209585127] [2021-06-05 22:14:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:25,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:25,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209585127] [2021-06-05 22:14:25,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209585127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:25,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086721129] [2021-06-05 22:14:25,593 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:25,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:25,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086721129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:25,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:25,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:25,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783949889] [2021-06-05 22:14:25,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:25,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:25,727 INFO L87 Difference]: Start difference. First operand 296 states and 889 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:25,948 INFO L93 Difference]: Finished difference Result 468 states and 1339 transitions. [2021-06-05 22:14:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:25,949 INFO L225 Difference]: With dead ends: 468 [2021-06-05 22:14:25,949 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 22:14:25,950 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 218.1ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 22:14:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 302. [2021-06-05 22:14:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.0232558139534884) internal successors, (910), 301 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 910 transitions. [2021-06-05 22:14:25,953 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 910 transitions. Word has length 18 [2021-06-05 22:14:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:25,953 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 910 transitions. [2021-06-05 22:14:25,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 910 transitions. [2021-06-05 22:14:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:25,954 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:25,954 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:26,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:26,161 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1565959223, now seen corresponding path program 20 times [2021-06-05 22:14:26,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:26,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586435336] [2021-06-05 22:14:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:26,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:26,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586435336] [2021-06-05 22:14:26,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586435336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:26,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304970754] [2021-06-05 22:14:26,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:26,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:26,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:26,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:26,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:26,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304970754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:26,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:26,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:26,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597187603] [2021-06-05 22:14:26,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:26,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:26,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:26,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:26,354 INFO L87 Difference]: Start difference. First operand 302 states and 910 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:26,561 INFO L93 Difference]: Finished difference Result 479 states and 1352 transitions. [2021-06-05 22:14:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:26,562 INFO L225 Difference]: With dead ends: 479 [2021-06-05 22:14:26,562 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 22:14:26,562 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 228.7ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 22:14:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 306. [2021-06-05 22:14:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.036065573770492) internal successors, (926), 305 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 926 transitions. [2021-06-05 22:14:26,565 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 926 transitions. Word has length 18 [2021-06-05 22:14:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:26,565 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 926 transitions. [2021-06-05 22:14:26,566 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 926 transitions. [2021-06-05 22:14:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:26,566 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:26,566 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:26,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:26,766 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash -635798047, now seen corresponding path program 21 times [2021-06-05 22:14:26,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:26,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772904383] [2021-06-05 22:14:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:26,814 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:26,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772904383] [2021-06-05 22:14:26,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772904383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:26,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187292075] [2021-06-05 22:14:26,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:26,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:26,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:26,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:26,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:26,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187292075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:26,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:26,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:26,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109645891] [2021-06-05 22:14:26,940 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:26,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:26,940 INFO L87 Difference]: Start difference. First operand 306 states and 926 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:27,162 INFO L93 Difference]: Finished difference Result 442 states and 1266 transitions. [2021-06-05 22:14:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:27,163 INFO L225 Difference]: With dead ends: 442 [2021-06-05 22:14:27,163 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 22:14:27,163 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 230.4ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 22:14:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 308. [2021-06-05 22:14:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.019543973941368) internal successors, (927), 307 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 927 transitions. [2021-06-05 22:14:27,166 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 927 transitions. Word has length 18 [2021-06-05 22:14:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:27,166 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 927 transitions. [2021-06-05 22:14:27,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 927 transitions. [2021-06-05 22:14:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:27,167 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:27,167 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:27,367 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:27,367 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1614261531, now seen corresponding path program 22 times [2021-06-05 22:14:27,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:27,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640026179] [2021-06-05 22:14:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:27,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:27,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640026179] [2021-06-05 22:14:27,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640026179] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:27,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676084363] [2021-06-05 22:14:27,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:27,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:27,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:27,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:27,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:27,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676084363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:27,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:27,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:27,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763190230] [2021-06-05 22:14:27,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:27,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:27,565 INFO L87 Difference]: Start difference. First operand 308 states and 927 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:27,725 INFO L93 Difference]: Finished difference Result 535 states and 1530 transitions. [2021-06-05 22:14:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:27,726 INFO L225 Difference]: With dead ends: 535 [2021-06-05 22:14:27,726 INFO L226 Difference]: Without dead ends: 516 [2021-06-05 22:14:27,726 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 184.8ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-06-05 22:14:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 303. [2021-06-05 22:14:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.0264900662251657) internal successors, (914), 302 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 914 transitions. [2021-06-05 22:14:27,731 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 914 transitions. Word has length 18 [2021-06-05 22:14:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:27,731 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 914 transitions. [2021-06-05 22:14:27,731 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 914 transitions. [2021-06-05 22:14:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:27,732 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:27,732 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:27,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2021-06-05 22:14:27,932 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1839327131, now seen corresponding path program 23 times [2021-06-05 22:14:27,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:27,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283706872] [2021-06-05 22:14:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:27,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:27,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283706872] [2021-06-05 22:14:27,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283706872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:27,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250932688] [2021-06-05 22:14:27,983 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:28,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:28,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:28,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:28,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:28,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250932688] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:28,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:28,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:28,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65889636] [2021-06-05 22:14:28,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:28,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:28,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:28,090 INFO L87 Difference]: Start difference. First operand 303 states and 914 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:28,240 INFO L93 Difference]: Finished difference Result 537 states and 1559 transitions. [2021-06-05 22:14:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:28,241 INFO L225 Difference]: With dead ends: 537 [2021-06-05 22:14:28,241 INFO L226 Difference]: Without dead ends: 518 [2021-06-05 22:14:28,241 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 137.1ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-06-05 22:14:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 307. [2021-06-05 22:14:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.052287581699346) internal successors, (934), 306 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 934 transitions. [2021-06-05 22:14:28,245 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 934 transitions. Word has length 18 [2021-06-05 22:14:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:28,245 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 934 transitions. [2021-06-05 22:14:28,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 934 transitions. [2021-06-05 22:14:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:28,246 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:28,246 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:28,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:28,446 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 756919777, now seen corresponding path program 24 times [2021-06-05 22:14:28,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:28,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854296446] [2021-06-05 22:14:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:28,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:28,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854296446] [2021-06-05 22:14:28,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854296446] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:28,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679450914] [2021-06-05 22:14:28,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:28,558 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:28,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:28,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:28,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:28,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679450914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:28,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:28,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:28,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599987644] [2021-06-05 22:14:28,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:28,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:28,630 INFO L87 Difference]: Start difference. First operand 307 states and 934 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:28,788 INFO L93 Difference]: Finished difference Result 500 states and 1473 transitions. [2021-06-05 22:14:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:28,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:28,790 INFO L225 Difference]: With dead ends: 500 [2021-06-05 22:14:28,790 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 22:14:28,790 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 130.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 22:14:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 299. [2021-06-05 22:14:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0134228187919465) internal successors, (898), 298 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 22:14:28,794 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 22:14:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:28,794 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 22:14:28,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 22:14:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:28,794 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:28,794 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:28,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 22:14:28,995 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1237003341, now seen corresponding path program 25 times [2021-06-05 22:14:28,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:28,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712021175] [2021-06-05 22:14:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:29,063 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:29,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712021175] [2021-06-05 22:14:29,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712021175] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:29,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479780252] [2021-06-05 22:14:29,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:29,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:29,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:29,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479780252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:29,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:29,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:29,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593592706] [2021-06-05 22:14:29,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:29,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:29,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:29,177 INFO L87 Difference]: Start difference. First operand 299 states and 898 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:29,353 INFO L93 Difference]: Finished difference Result 506 states and 1446 transitions. [2021-06-05 22:14:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:29,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:29,354 INFO L225 Difference]: With dead ends: 506 [2021-06-05 22:14:29,354 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 22:14:29,354 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 200.6ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 22:14:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 305. [2021-06-05 22:14:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0427631578947367) internal successors, (925), 304 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 925 transitions. [2021-06-05 22:14:29,360 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 925 transitions. Word has length 18 [2021-06-05 22:14:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:29,360 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 925 transitions. [2021-06-05 22:14:29,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 925 transitions. [2021-06-05 22:14:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:29,361 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:29,361 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:29,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2021-06-05 22:14:29,583 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2127802779, now seen corresponding path program 26 times [2021-06-05 22:14:29,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:29,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998044366] [2021-06-05 22:14:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:29,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:29,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998044366] [2021-06-05 22:14:29,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998044366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:29,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754277924] [2021-06-05 22:14:29,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:29,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:29,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:29,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:29,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:29,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754277924] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:29,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:29,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:29,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259821247] [2021-06-05 22:14:29,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:29,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:29,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:29,758 INFO L87 Difference]: Start difference. First operand 305 states and 925 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:29,921 INFO L93 Difference]: Finished difference Result 494 states and 1406 transitions. [2021-06-05 22:14:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:29,922 INFO L225 Difference]: With dead ends: 494 [2021-06-05 22:14:29,922 INFO L226 Difference]: Without dead ends: 471 [2021-06-05 22:14:29,922 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 178.4ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-06-05 22:14:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 307. [2021-06-05 22:14:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.026143790849673) internal successors, (926), 306 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 926 transitions. [2021-06-05 22:14:29,926 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 926 transitions. Word has length 18 [2021-06-05 22:14:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:29,926 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 926 transitions. [2021-06-05 22:14:29,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 926 transitions. [2021-06-05 22:14:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:29,927 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:29,927 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:30,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2021-06-05 22:14:30,127 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1507513033, now seen corresponding path program 27 times [2021-06-05 22:14:30,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:30,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416427505] [2021-06-05 22:14:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:30,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:30,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416427505] [2021-06-05 22:14:30,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416427505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:30,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905468151] [2021-06-05 22:14:30,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:30,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:30,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:30,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:30,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:30,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905468151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:30,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:30,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:30,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904571011] [2021-06-05 22:14:30,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:30,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:30,320 INFO L87 Difference]: Start difference. First operand 307 states and 926 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:30,534 INFO L93 Difference]: Finished difference Result 509 states and 1449 transitions. [2021-06-05 22:14:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:30,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:30,535 INFO L225 Difference]: With dead ends: 509 [2021-06-05 22:14:30,535 INFO L226 Difference]: Without dead ends: 490 [2021-06-05 22:14:30,535 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 212.9ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-05 22:14:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 304. [2021-06-05 22:14:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.046204620462046) internal successors, (923), 303 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 923 transitions. [2021-06-05 22:14:30,539 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 923 transitions. Word has length 18 [2021-06-05 22:14:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:30,539 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 923 transitions. [2021-06-05 22:14:30,539 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 923 transitions. [2021-06-05 22:14:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:30,540 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:30,540 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:30,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:30,740 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1326384585, now seen corresponding path program 28 times [2021-06-05 22:14:30,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:30,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020773222] [2021-06-05 22:14:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:30,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:30,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020773222] [2021-06-05 22:14:30,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020773222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:30,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635086846] [2021-06-05 22:14:30,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:30,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:30,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:30,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:30,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:30,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635086846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:30,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:30,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:30,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644373579] [2021-06-05 22:14:30,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:30,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:30,921 INFO L87 Difference]: Start difference. First operand 304 states and 923 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:31,053 INFO L93 Difference]: Finished difference Result 490 states and 1420 transitions. [2021-06-05 22:14:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:31,054 INFO L225 Difference]: With dead ends: 490 [2021-06-05 22:14:31,054 INFO L226 Difference]: Without dead ends: 471 [2021-06-05 22:14:31,054 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-06-05 22:14:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 300. [2021-06-05 22:14:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.020066889632107) internal successors, (903), 299 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 903 transitions. [2021-06-05 22:14:31,058 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 903 transitions. Word has length 18 [2021-06-05 22:14:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:31,058 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 903 transitions. [2021-06-05 22:14:31,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 903 transitions. [2021-06-05 22:14:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:31,058 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:31,058 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:31,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable214 [2021-06-05 22:14:31,259 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash -554908191, now seen corresponding path program 29 times [2021-06-05 22:14:31,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:31,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081938496] [2021-06-05 22:14:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:31,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:31,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081938496] [2021-06-05 22:14:31,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081938496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:31,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753695976] [2021-06-05 22:14:31,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:31,336 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:31,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:31,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:31,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753695976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:31,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:31,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:31,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274010214] [2021-06-05 22:14:31,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:31,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:31,423 INFO L87 Difference]: Start difference. First operand 300 states and 903 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:31,627 INFO L93 Difference]: Finished difference Result 447 states and 1285 transitions. [2021-06-05 22:14:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:31,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:31,628 INFO L225 Difference]: With dead ends: 447 [2021-06-05 22:14:31,628 INFO L226 Difference]: Without dead ends: 424 [2021-06-05 22:14:31,628 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 193.2ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-06-05 22:14:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 308. [2021-06-05 22:14:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.013029315960912) internal successors, (925), 307 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 925 transitions. [2021-06-05 22:14:31,633 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 925 transitions. Word has length 18 [2021-06-05 22:14:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:31,633 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 925 transitions. [2021-06-05 22:14:31,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 925 transitions. [2021-06-05 22:14:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:31,634 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:31,634 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:31,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable217 [2021-06-05 22:14:31,845 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash 423649253, now seen corresponding path program 30 times [2021-06-05 22:14:31,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:31,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424430525] [2021-06-05 22:14:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:31,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:31,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424430525] [2021-06-05 22:14:31,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424430525] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:31,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140494939] [2021-06-05 22:14:31,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:31,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:31,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:31,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:31,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:32,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140494939] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:32,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:32,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:32,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779141379] [2021-06-05 22:14:32,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:32,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:32,014 INFO L87 Difference]: Start difference. First operand 308 states and 925 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:32,228 INFO L93 Difference]: Finished difference Result 431 states and 1255 transitions. [2021-06-05 22:14:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:32,229 INFO L225 Difference]: With dead ends: 431 [2021-06-05 22:14:32,230 INFO L226 Difference]: Without dead ends: 412 [2021-06-05 22:14:32,230 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 198.7ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-06-05 22:14:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 299. [2021-06-05 22:14:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0134228187919465) internal successors, (898), 298 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 22:14:32,234 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 22:14:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:32,234 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 22:14:32,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 22:14:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:32,235 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:32,235 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:32,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2021-06-05 22:14:32,458 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 427729059, now seen corresponding path program 31 times [2021-06-05 22:14:32,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:32,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706106815] [2021-06-05 22:14:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:32,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:32,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706106815] [2021-06-05 22:14:32,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706106815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:32,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595679835] [2021-06-05 22:14:32,507 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:32,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:32,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:32,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595679835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:32,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:32,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:32,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737635540] [2021-06-05 22:14:32,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:32,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:32,622 INFO L87 Difference]: Start difference. First operand 299 states and 898 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:32,764 INFO L93 Difference]: Finished difference Result 569 states and 1629 transitions. [2021-06-05 22:14:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:32,765 INFO L225 Difference]: With dead ends: 569 [2021-06-05 22:14:32,765 INFO L226 Difference]: Without dead ends: 550 [2021-06-05 22:14:32,765 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 143.3ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-06-05 22:14:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 306. [2021-06-05 22:14:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.036065573770492) internal successors, (926), 305 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 926 transitions. [2021-06-05 22:14:32,770 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 926 transitions. Word has length 18 [2021-06-05 22:14:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:32,770 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 926 transitions. [2021-06-05 22:14:32,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 926 transitions. [2021-06-05 22:14:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:32,770 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:32,770 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:32,970 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable225 [2021-06-05 22:14:32,971 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1635282131, now seen corresponding path program 32 times [2021-06-05 22:14:32,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:32,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23460390] [2021-06-05 22:14:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:33,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:33,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23460390] [2021-06-05 22:14:33,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23460390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:33,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93222536] [2021-06-05 22:14:33,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:33,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:33,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:33,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:33,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:33,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93222536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:33,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:33,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:33,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802580073] [2021-06-05 22:14:33,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:33,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:33,104 INFO L87 Difference]: Start difference. First operand 306 states and 926 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:33,221 INFO L93 Difference]: Finished difference Result 581 states and 1668 transitions. [2021-06-05 22:14:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:33,222 INFO L225 Difference]: With dead ends: 581 [2021-06-05 22:14:33,222 INFO L226 Difference]: Without dead ends: 562 [2021-06-05 22:14:33,222 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 115.6ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-06-05 22:14:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 310. [2021-06-05 22:14:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.0614886731391584) internal successors, (946), 309 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 946 transitions. [2021-06-05 22:14:33,226 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 946 transitions. Word has length 18 [2021-06-05 22:14:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:33,226 INFO L482 AbstractCegarLoop]: Abstraction has 310 states and 946 transitions. [2021-06-05 22:14:33,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 946 transitions. [2021-06-05 22:14:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:33,227 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:33,227 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:33,427 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:33,427 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash -63438257, now seen corresponding path program 33 times [2021-06-05 22:14:33,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:33,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952632751] [2021-06-05 22:14:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:33,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:33,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952632751] [2021-06-05 22:14:33,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952632751] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:33,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265013784] [2021-06-05 22:14:33,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:33,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:33,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:33,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:33,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265013784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:33,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:33,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:33,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305421056] [2021-06-05 22:14:33,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:33,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:33,602 INFO L87 Difference]: Start difference. First operand 310 states and 946 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:33,777 INFO L93 Difference]: Finished difference Result 590 states and 1691 transitions. [2021-06-05 22:14:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:33,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:33,779 INFO L225 Difference]: With dead ends: 590 [2021-06-05 22:14:33,779 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 22:14:33,779 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 161.9ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 22:14:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 299. [2021-06-05 22:14:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0134228187919465) internal successors, (898), 298 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 22:14:33,785 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 22:14:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:33,785 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 22:14:33,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 22:14:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:33,786 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:33,786 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:34,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:34,000 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1646468570, now seen corresponding path program 4 times [2021-06-05 22:14:34,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:34,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161727094] [2021-06-05 22:14:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:34,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:34,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161727094] [2021-06-05 22:14:34,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161727094] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:34,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:34,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:34,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025695142] [2021-06-05 22:14:34,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:34,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:34,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:34,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:34,041 INFO L87 Difference]: Start difference. First operand 299 states and 898 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:34,103 INFO L93 Difference]: Finished difference Result 429 states and 1249 transitions. [2021-06-05 22:14:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:34,104 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:14:34,104 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 22:14:34,104 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 22:14:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 294. [2021-06-05 22:14:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.0) internal successors, (879), 293 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 879 transitions. [2021-06-05 22:14:34,107 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 879 transitions. Word has length 18 [2021-06-05 22:14:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:34,107 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 879 transitions. [2021-06-05 22:14:34,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 879 transitions. [2021-06-05 22:14:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:34,108 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:34,108 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:34,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-06-05 22:14:34,108 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash -269670517, now seen corresponding path program 34 times [2021-06-05 22:14:34,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:34,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183009093] [2021-06-05 22:14:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:34,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:34,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183009093] [2021-06-05 22:14:34,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183009093] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:34,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881316873] [2021-06-05 22:14:34,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:34,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:34,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:34,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:34,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:34,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881316873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:34,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:34,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:34,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559106387] [2021-06-05 22:14:34,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:34,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:34,307 INFO L87 Difference]: Start difference. First operand 294 states and 879 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:34,514 INFO L93 Difference]: Finished difference Result 648 states and 1820 transitions. [2021-06-05 22:14:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:34,515 INFO L225 Difference]: With dead ends: 648 [2021-06-05 22:14:34,515 INFO L226 Difference]: Without dead ends: 629 [2021-06-05 22:14:34,515 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 218.3ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-06-05 22:14:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 298. [2021-06-05 22:14:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.993265993265993) internal successors, (889), 297 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 889 transitions. [2021-06-05 22:14:34,519 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 889 transitions. Word has length 18 [2021-06-05 22:14:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:34,519 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 889 transitions. [2021-06-05 22:14:34,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 889 transitions. [2021-06-05 22:14:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:34,519 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:34,520 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:34,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 22:14:34,720 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash -472443849, now seen corresponding path program 35 times [2021-06-05 22:14:34,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:34,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664737642] [2021-06-05 22:14:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:34,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:34,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664737642] [2021-06-05 22:14:34,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664737642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:34,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263468629] [2021-06-05 22:14:34,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:34,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:34,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:34,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:34,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263468629] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:34,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:34,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:34,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41613967] [2021-06-05 22:14:34,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:34,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:34,923 INFO L87 Difference]: Start difference. First operand 298 states and 889 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:35,175 INFO L93 Difference]: Finished difference Result 606 states and 1708 transitions. [2021-06-05 22:14:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:35,176 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:35,176 INFO L225 Difference]: With dead ends: 606 [2021-06-05 22:14:35,176 INFO L226 Difference]: Without dead ends: 583 [2021-06-05 22:14:35,177 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 250.4ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-06-05 22:14:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 306. [2021-06-05 22:14:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.9868852459016395) internal successors, (911), 305 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 911 transitions. [2021-06-05 22:14:35,181 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 911 transitions. Word has length 18 [2021-06-05 22:14:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:35,181 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 911 transitions. [2021-06-05 22:14:35,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 911 transitions. [2021-06-05 22:14:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:35,181 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:35,181 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:35,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable238 [2021-06-05 22:14:35,382 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1687803469, now seen corresponding path program 36 times [2021-06-05 22:14:35,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:35,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215972859] [2021-06-05 22:14:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:35,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:35,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215972859] [2021-06-05 22:14:35,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215972859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:35,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759539874] [2021-06-05 22:14:35,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:35,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:35,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:35,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:35,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:35,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759539874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:35,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:35,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:35,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583671537] [2021-06-05 22:14:35,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:35,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:35,569 INFO L87 Difference]: Start difference. First operand 306 states and 911 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:35,809 INFO L93 Difference]: Finished difference Result 590 states and 1678 transitions. [2021-06-05 22:14:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:35,810 INFO L225 Difference]: With dead ends: 590 [2021-06-05 22:14:35,810 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 22:14:35,810 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 233.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 22:14:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 294. [2021-06-05 22:14:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.0) internal successors, (879), 293 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 879 transitions. [2021-06-05 22:14:35,814 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 879 transitions. Word has length 18 [2021-06-05 22:14:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:35,814 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 879 transitions. [2021-06-05 22:14:35,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 879 transitions. [2021-06-05 22:14:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:35,815 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:35,815 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:36,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2021-06-05 22:14:36,015 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1039285976, now seen corresponding path program 5 times [2021-06-05 22:14:36,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:36,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873668069] [2021-06-05 22:14:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:36,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:36,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873668069] [2021-06-05 22:14:36,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873668069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:36,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404649781] [2021-06-05 22:14:36,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:36,073 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:36,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:36,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:14:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:36,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404649781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:36,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:36,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 22:14:36,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892769816] [2021-06-05 22:14:36,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:36,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:36,124 INFO L87 Difference]: Start difference. First operand 294 states and 879 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:36,191 INFO L93 Difference]: Finished difference Result 448 states and 1287 transitions. [2021-06-05 22:14:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:36,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:36,192 INFO L225 Difference]: With dead ends: 448 [2021-06-05 22:14:36,192 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 22:14:36,192 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 22:14:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 287. [2021-06-05 22:14:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.958041958041958) internal successors, (846), 286 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 846 transitions. [2021-06-05 22:14:36,195 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 846 transitions. Word has length 18 [2021-06-05 22:14:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:36,195 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 846 transitions. [2021-06-05 22:14:36,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 846 transitions. [2021-06-05 22:14:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:36,196 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:36,196 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:36,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-05 22:14:36,396 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash -603032005, now seen corresponding path program 37 times [2021-06-05 22:14:36,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:36,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153515795] [2021-06-05 22:14:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:36,450 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:36,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153515795] [2021-06-05 22:14:36,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153515795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:36,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288263821] [2021-06-05 22:14:36,450 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:36,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:36,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288263821] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:36,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:36,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:14:36,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815749200] [2021-06-05 22:14:36,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:36,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:36,565 INFO L87 Difference]: Start difference. First operand 287 states and 846 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:36,733 INFO L93 Difference]: Finished difference Result 610 states and 1732 transitions. [2021-06-05 22:14:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:36,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:36,734 INFO L225 Difference]: With dead ends: 610 [2021-06-05 22:14:36,734 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 22:14:36,735 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 167.9ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 22:14:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 293. [2021-06-05 22:14:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 2.98972602739726) internal successors, (873), 292 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 873 transitions. [2021-06-05 22:14:36,739 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 873 transitions. Word has length 18 [2021-06-05 22:14:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:36,739 INFO L482 AbstractCegarLoop]: Abstraction has 293 states and 873 transitions. [2021-06-05 22:14:36,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 873 transitions. [2021-06-05 22:14:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:36,739 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:36,739 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:36,939 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:36,940 INFO L430 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:36,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 327129171, now seen corresponding path program 38 times [2021-06-05 22:14:36,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:36,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606259683] [2021-06-05 22:14:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:36,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:36,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606259683] [2021-06-05 22:14:36,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606259683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:36,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219818860] [2021-06-05 22:14:36,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:37,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:37,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:37,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:37,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:37,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219818860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:37,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:37,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:37,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641743133] [2021-06-05 22:14:37,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:37,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:37,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:37,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:37,091 INFO L87 Difference]: Start difference. First operand 293 states and 873 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:37,259 INFO L93 Difference]: Finished difference Result 598 states and 1692 transitions. [2021-06-05 22:14:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:37,260 INFO L225 Difference]: With dead ends: 598 [2021-06-05 22:14:37,260 INFO L226 Difference]: Without dead ends: 575 [2021-06-05 22:14:37,260 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 160.3ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-06-05 22:14:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 295. [2021-06-05 22:14:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 2.9727891156462585) internal successors, (874), 294 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 874 transitions. [2021-06-05 22:14:37,265 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 874 transitions. Word has length 18 [2021-06-05 22:14:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:37,265 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 874 transitions. [2021-06-05 22:14:37,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 874 transitions. [2021-06-05 22:14:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:37,266 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:37,266 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:37,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:37,489 INFO L430 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:37,489 INFO L82 PathProgramCache]: Analyzing trace with hash -332522313, now seen corresponding path program 39 times [2021-06-05 22:14:37,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:37,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137848992] [2021-06-05 22:14:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:37,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:37,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137848992] [2021-06-05 22:14:37,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137848992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:37,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634786819] [2021-06-05 22:14:37,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:37,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:37,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:37,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:37,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:37,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634786819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:37,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:37,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 22:14:37,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395084409] [2021-06-05 22:14:37,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 22:14:37,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 22:14:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:37,697 INFO L87 Difference]: Start difference. First operand 295 states and 874 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:37,899 INFO L93 Difference]: Finished difference Result 653 states and 1829 transitions. [2021-06-05 22:14:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:37,900 INFO L225 Difference]: With dead ends: 653 [2021-06-05 22:14:37,900 INFO L226 Difference]: Without dead ends: 634 [2021-06-05 22:14:37,900 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 226.8ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-06-05 22:14:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 292. [2021-06-05 22:14:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.993127147766323) internal successors, (871), 291 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 871 transitions. [2021-06-05 22:14:37,904 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 871 transitions. Word has length 18 [2021-06-05 22:14:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:37,904 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 871 transitions. [2021-06-05 22:14:37,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 871 transitions. [2021-06-05 22:14:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:37,905 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:37,905 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:38,105 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:38,106 INFO L430 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -513650761, now seen corresponding path program 40 times [2021-06-05 22:14:38,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:38,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458874224] [2021-06-05 22:14:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:38,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:38,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458874224] [2021-06-05 22:14:38,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458874224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:38,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720678517] [2021-06-05 22:14:38,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:38,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:38,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:38,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:38,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:38,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720678517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:38,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:38,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:38,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624268036] [2021-06-05 22:14:38,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:38,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:38,270 INFO L87 Difference]: Start difference. First operand 292 states and 871 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:38,424 INFO L93 Difference]: Finished difference Result 634 states and 1800 transitions. [2021-06-05 22:14:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:38,426 INFO L225 Difference]: With dead ends: 634 [2021-06-05 22:14:38,426 INFO L226 Difference]: Without dead ends: 615 [2021-06-05 22:14:38,426 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 126.5ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-06-05 22:14:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 288. [2021-06-05 22:14:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.965156794425087) internal successors, (851), 287 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 851 transitions. [2021-06-05 22:14:38,430 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 851 transitions. Word has length 18 [2021-06-05 22:14:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:38,430 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 851 transitions. [2021-06-05 22:14:38,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 851 transitions. [2021-06-05 22:14:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:38,431 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:38,431 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:38,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262,45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:38,633 INFO L430 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1900023759, now seen corresponding path program 41 times [2021-06-05 22:14:38,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:38,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328540505] [2021-06-05 22:14:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:38,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:38,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328540505] [2021-06-05 22:14:38,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328540505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:38,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528926779] [2021-06-05 22:14:38,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:38,708 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:38,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:38,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:38,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:38,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528926779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:38,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:38,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:38,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316062174] [2021-06-05 22:14:38,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:38,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:38,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:38,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:38,824 INFO L87 Difference]: Start difference. First operand 288 states and 851 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:39,037 INFO L93 Difference]: Finished difference Result 606 states and 1702 transitions. [2021-06-05 22:14:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:39,039 INFO L225 Difference]: With dead ends: 606 [2021-06-05 22:14:39,039 INFO L226 Difference]: Without dead ends: 583 [2021-06-05 22:14:39,039 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 200.2ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-06-05 22:14:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 296. [2021-06-05 22:14:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.9593220338983053) internal successors, (873), 295 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 873 transitions. [2021-06-05 22:14:39,043 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 873 transitions. Word has length 18 [2021-06-05 22:14:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:39,043 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 873 transitions. [2021-06-05 22:14:39,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 873 transitions. [2021-06-05 22:14:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:39,044 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:39,044 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:39,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable265 [2021-06-05 22:14:39,246 INFO L430 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1416386093, now seen corresponding path program 42 times [2021-06-05 22:14:39,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:39,246 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221136466] [2021-06-05 22:14:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:39,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:39,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221136466] [2021-06-05 22:14:39,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221136466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:39,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517604372] [2021-06-05 22:14:39,315 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:39,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:39,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:39,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:39,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:39,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517604372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:39,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:39,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:39,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335235209] [2021-06-05 22:14:39,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:39,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:39,436 INFO L87 Difference]: Start difference. First operand 296 states and 873 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:39,658 INFO L93 Difference]: Finished difference Result 590 states and 1672 transitions. [2021-06-05 22:14:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:39,659 INFO L225 Difference]: With dead ends: 590 [2021-06-05 22:14:39,659 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 22:14:39,659 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 208.2ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 22:14:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 285. [2021-06-05 22:14:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.9507042253521125) internal successors, (838), 284 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 838 transitions. [2021-06-05 22:14:39,663 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 838 transitions. Word has length 18 [2021-06-05 22:14:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:39,663 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 838 transitions. [2021-06-05 22:14:39,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 838 transitions. [2021-06-05 22:14:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:39,663 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:39,663 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:39,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable270 [2021-06-05 22:14:39,864 INFO L430 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1542604225, now seen corresponding path program 43 times [2021-06-05 22:14:39,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:39,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698947470] [2021-06-05 22:14:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:39,918 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:39,918 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698947470] [2021-06-05 22:14:39,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698947470] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:39,918 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27436254] [2021-06-05 22:14:39,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:39,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:39,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:40,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27436254] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:40,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:40,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:40,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433791057] [2021-06-05 22:14:40,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:40,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:40,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:40,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:40,028 INFO L87 Difference]: Start difference. First operand 285 states and 838 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:40,271 INFO L93 Difference]: Finished difference Result 479 states and 1339 transitions. [2021-06-05 22:14:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:40,272 INFO L225 Difference]: With dead ends: 479 [2021-06-05 22:14:40,273 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 22:14:40,273 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 256.6ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 22:14:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 289. [2021-06-05 22:14:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.9444444444444446) internal successors, (848), 288 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 848 transitions. [2021-06-05 22:14:40,276 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 848 transitions. Word has length 18 [2021-06-05 22:14:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:40,276 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 848 transitions. [2021-06-05 22:14:40,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 848 transitions. [2021-06-05 22:14:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:40,277 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:40,277 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:40,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:40,477 INFO L430 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1745377557, now seen corresponding path program 44 times [2021-06-05 22:14:40,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:40,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827570441] [2021-06-05 22:14:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:40,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:40,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827570441] [2021-06-05 22:14:40,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827570441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:40,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734979064] [2021-06-05 22:14:40,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:40,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:40,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:40,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:40,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:40,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734979064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:40,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:40,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:40,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875338168] [2021-06-05 22:14:40,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:40,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:40,684 INFO L87 Difference]: Start difference. First operand 289 states and 848 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:40,951 INFO L93 Difference]: Finished difference Result 485 states and 1345 transitions. [2021-06-05 22:14:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:40,952 INFO L225 Difference]: With dead ends: 485 [2021-06-05 22:14:40,952 INFO L226 Difference]: Without dead ends: 462 [2021-06-05 22:14:40,952 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 295.7ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-06-05 22:14:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 297. [2021-06-05 22:14:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.939189189189189) internal successors, (870), 296 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 870 transitions. [2021-06-05 22:14:40,956 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 870 transitions. Word has length 18 [2021-06-05 22:14:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:40,956 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 870 transitions. [2021-06-05 22:14:40,956 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 870 transitions. [2021-06-05 22:14:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:40,957 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:40,957 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:41,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable276 [2021-06-05 22:14:41,157 INFO L430 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1334230119, now seen corresponding path program 45 times [2021-06-05 22:14:41,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:41,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97599277] [2021-06-05 22:14:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:41,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:41,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97599277] [2021-06-05 22:14:41,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97599277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:41,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804354973] [2021-06-05 22:14:41,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:41,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:41,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:41,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:41,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:41,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804354973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:41,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:41,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:41,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515057924] [2021-06-05 22:14:41,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:41,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:41,360 INFO L87 Difference]: Start difference. First operand 297 states and 870 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:41,641 INFO L93 Difference]: Finished difference Result 469 states and 1315 transitions. [2021-06-05 22:14:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:41,641 INFO L225 Difference]: With dead ends: 469 [2021-06-05 22:14:41,641 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 22:14:41,642 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 277.7ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 22:14:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 285. [2021-06-05 22:14:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.9507042253521125) internal successors, (838), 284 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 838 transitions. [2021-06-05 22:14:41,646 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 838 transitions. Word has length 18 [2021-06-05 22:14:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:41,646 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 838 transitions. [2021-06-05 22:14:41,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 838 transitions. [2021-06-05 22:14:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:41,647 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:41,647 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:41,860 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable281 [2021-06-05 22:14:41,861 INFO L430 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:41,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1633409787, now seen corresponding path program 46 times [2021-06-05 22:14:41,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:41,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544271468] [2021-06-05 22:14:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:41,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:41,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544271468] [2021-06-05 22:14:41,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544271468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:41,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898801390] [2021-06-05 22:14:41,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:41,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:41,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:41,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:41,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:42,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898801390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:42,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:42,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:42,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463942045] [2021-06-05 22:14:42,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:42,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:42,026 INFO L87 Difference]: Start difference. First operand 285 states and 838 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:42,340 INFO L93 Difference]: Finished difference Result 433 states and 1220 transitions. [2021-06-05 22:14:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:42,341 INFO L225 Difference]: With dead ends: 433 [2021-06-05 22:14:42,341 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 22:14:42,341 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 315.1ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 22:14:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 287. [2021-06-05 22:14:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 2.9475524475524475) internal successors, (843), 286 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 843 transitions. [2021-06-05 22:14:42,346 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 843 transitions. Word has length 18 [2021-06-05 22:14:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:42,346 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 843 transitions. [2021-06-05 22:14:42,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 843 transitions. [2021-06-05 22:14:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:42,347 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:42,347 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:42,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:42,561 INFO L430 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 44908247, now seen corresponding path program 6 times [2021-06-05 22:14:42,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:42,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739725755] [2021-06-05 22:14:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:42,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:42,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739725755] [2021-06-05 22:14:42,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739725755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:42,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271423741] [2021-06-05 22:14:42,600 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:42,627 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:42,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:42,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 22:14:42,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:42,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271423741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:42,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:42,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:42,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829668654] [2021-06-05 22:14:42,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:42,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:42,700 INFO L87 Difference]: Start difference. First operand 287 states and 843 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:42,861 INFO L93 Difference]: Finished difference Result 476 states and 1332 transitions. [2021-06-05 22:14:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:42,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:42,861 INFO L225 Difference]: With dead ends: 476 [2021-06-05 22:14:42,861 INFO L226 Difference]: Without dead ends: 454 [2021-06-05 22:14:42,862 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 140.9ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-06-05 22:14:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 289. [2021-06-05 22:14:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.951388888888889) internal successors, (850), 288 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 850 transitions. [2021-06-05 22:14:42,866 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 850 transitions. Word has length 18 [2021-06-05 22:14:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:42,866 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 850 transitions. [2021-06-05 22:14:42,866 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 850 transitions. [2021-06-05 22:14:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:42,866 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:42,866 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:43,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable289 [2021-06-05 22:14:43,067 INFO L430 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -675858551, now seen corresponding path program 47 times [2021-06-05 22:14:43,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:43,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167796503] [2021-06-05 22:14:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:43,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:43,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167796503] [2021-06-05 22:14:43,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167796503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:43,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453762583] [2021-06-05 22:14:43,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:43,145 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:43,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:43,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:43,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:43,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453762583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:43,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:43,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:43,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700156708] [2021-06-05 22:14:43,249 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:43,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:43,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:43,249 INFO L87 Difference]: Start difference. First operand 289 states and 850 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:43,510 INFO L93 Difference]: Finished difference Result 434 states and 1224 transitions. [2021-06-05 22:14:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:43,511 INFO L225 Difference]: With dead ends: 434 [2021-06-05 22:14:43,511 INFO L226 Difference]: Without dead ends: 411 [2021-06-05 22:14:43,511 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 266.4ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-06-05 22:14:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 297. [2021-06-05 22:14:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.9527027027027026) internal successors, (874), 296 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 874 transitions. [2021-06-05 22:14:43,514 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 874 transitions. Word has length 18 [2021-06-05 22:14:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:43,514 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 874 transitions. [2021-06-05 22:14:43,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 874 transitions. [2021-06-05 22:14:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:43,515 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:43,515 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:43,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:43,715 INFO L430 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:43,715 INFO L82 PathProgramCache]: Analyzing trace with hash 438614075, now seen corresponding path program 7 times [2021-06-05 22:14:43,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:43,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590199403] [2021-06-05 22:14:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:43,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:43,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590199403] [2021-06-05 22:14:43,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590199403] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:43,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478719321] [2021-06-05 22:14:43,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:43,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 22:14:43,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:43,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478719321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:43,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:43,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:43,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014967026] [2021-06-05 22:14:43,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:43,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:43,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:43,855 INFO L87 Difference]: Start difference. First operand 297 states and 874 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:44,003 INFO L93 Difference]: Finished difference Result 491 states and 1363 transitions. [2021-06-05 22:14:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:44,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:44,003 INFO L225 Difference]: With dead ends: 491 [2021-06-05 22:14:44,004 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 22:14:44,004 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 143.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 22:14:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 297. [2021-06-05 22:14:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.9527027027027026) internal successors, (874), 296 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 874 transitions. [2021-06-05 22:14:44,007 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 874 transitions. Word has length 18 [2021-06-05 22:14:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:44,007 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 874 transitions. [2021-06-05 22:14:44,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 874 transitions. [2021-06-05 22:14:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:44,008 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:44,008 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:44,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable297 [2021-06-05 22:14:44,210 INFO L430 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:44,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:44,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1891218171, now seen corresponding path program 48 times [2021-06-05 22:14:44,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:44,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088471740] [2021-06-05 22:14:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:44,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:44,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088471740] [2021-06-05 22:14:44,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088471740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:44,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516134801] [2021-06-05 22:14:44,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:44,326 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:44,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:44,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:44,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:44,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516134801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:44,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:44,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:44,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504961856] [2021-06-05 22:14:44,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:44,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:44,419 INFO L87 Difference]: Start difference. First operand 297 states and 874 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:44,659 INFO L93 Difference]: Finished difference Result 409 states and 1172 transitions. [2021-06-05 22:14:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:44,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:44,660 INFO L225 Difference]: With dead ends: 409 [2021-06-05 22:14:44,661 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 22:14:44,661 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 261.2ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 22:14:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 291. [2021-06-05 22:14:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.9551724137931035) internal successors, (857), 290 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 857 transitions. [2021-06-05 22:14:44,665 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 857 transitions. Word has length 18 [2021-06-05 22:14:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:44,665 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 857 transitions. [2021-06-05 22:14:44,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 857 transitions. [2021-06-05 22:14:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:44,665 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:44,665 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:44,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 22:14:44,882 INFO L430 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1494230001, now seen corresponding path program 8 times [2021-06-05 22:14:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:44,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829352207] [2021-06-05 22:14:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:44,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:44,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829352207] [2021-06-05 22:14:44,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829352207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:44,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:44,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 22:14:44,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495198664] [2021-06-05 22:14:44,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:44,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:44,922 INFO L87 Difference]: Start difference. First operand 291 states and 857 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:45,056 INFO L93 Difference]: Finished difference Result 449 states and 1262 transitions. [2021-06-05 22:14:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:45,056 INFO L225 Difference]: With dead ends: 449 [2021-06-05 22:14:45,056 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 22:14:45,057 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 22:14:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 289. [2021-06-05 22:14:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.951388888888889) internal successors, (850), 288 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 850 transitions. [2021-06-05 22:14:45,060 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 850 transitions. Word has length 18 [2021-06-05 22:14:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:45,060 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 850 transitions. [2021-06-05 22:14:45,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 850 transitions. [2021-06-05 22:14:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:45,060 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:45,060 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:45,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-06-05 22:14:45,061 INFO L430 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:45,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1770591994, now seen corresponding path program 6 times [2021-06-05 22:14:45,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:45,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007373759] [2021-06-05 22:14:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:45,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:45,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007373759] [2021-06-05 22:14:45,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007373759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:45,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967208891] [2021-06-05 22:14:45,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:45,118 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:45,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:45,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 22:14:45,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:45,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967208891] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:45,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:45,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-06-05 22:14:45,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981274876] [2021-06-05 22:14:45,206 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:45,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:45,207 INFO L87 Difference]: Start difference. First operand 289 states and 850 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:45,358 INFO L93 Difference]: Finished difference Result 435 states and 1232 transitions. [2021-06-05 22:14:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:14:45,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:45,359 INFO L225 Difference]: With dead ends: 435 [2021-06-05 22:14:45,359 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 22:14:45,359 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 134.2ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 22:14:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 255. [2021-06-05 22:14:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.9803149606299213) internal successors, (757), 254 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 757 transitions. [2021-06-05 22:14:45,367 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 757 transitions. Word has length 18 [2021-06-05 22:14:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:45,367 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 757 transitions. [2021-06-05 22:14:45,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 757 transitions. [2021-06-05 22:14:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:45,367 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:45,367 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:45,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:45,581 INFO L430 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 698798277, now seen corresponding path program 49 times [2021-06-05 22:14:45,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:45,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448463432] [2021-06-05 22:14:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:45,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:45,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448463432] [2021-06-05 22:14:45,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448463432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:45,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611217654] [2021-06-05 22:14:45,637 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:45,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:45,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:45,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611217654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:45,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:45,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:14:45,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492963189] [2021-06-05 22:14:45,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:45,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:45,775 INFO L87 Difference]: Start difference. First operand 255 states and 757 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:46,000 INFO L93 Difference]: Finished difference Result 457 states and 1299 transitions. [2021-06-05 22:14:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:46,001 INFO L225 Difference]: With dead ends: 457 [2021-06-05 22:14:46,001 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 22:14:46,002 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 240.8ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 22:14:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 260. [2021-06-05 22:14:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.996138996138996) internal successors, (776), 259 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 776 transitions. [2021-06-05 22:14:46,005 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 776 transitions. Word has length 18 [2021-06-05 22:14:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:46,005 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 776 transitions. [2021-06-05 22:14:46,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 776 transitions. [2021-06-05 22:14:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:46,005 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:46,005 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:46,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308,57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:46,209 INFO L430 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1628959453, now seen corresponding path program 50 times [2021-06-05 22:14:46,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:46,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097025360] [2021-06-05 22:14:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:46,256 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:46,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097025360] [2021-06-05 22:14:46,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097025360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:46,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288841497] [2021-06-05 22:14:46,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:46,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:46,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:46,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:46,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:46,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288841497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:46,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:46,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:46,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932871665] [2021-06-05 22:14:46,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:46,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:46,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:46,359 INFO L87 Difference]: Start difference. First operand 260 states and 776 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:46,593 INFO L93 Difference]: Finished difference Result 461 states and 1299 transitions. [2021-06-05 22:14:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:46,594 INFO L225 Difference]: With dead ends: 461 [2021-06-05 22:14:46,594 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 22:14:46,594 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 229.8ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 22:14:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 258. [2021-06-05 22:14:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.992217898832685) internal successors, (769), 257 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 769 transitions. [2021-06-05 22:14:46,598 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 769 transitions. Word has length 18 [2021-06-05 22:14:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:46,598 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 769 transitions. [2021-06-05 22:14:46,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 769 transitions. [2021-06-05 22:14:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:46,598 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:46,598 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:46,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:46,799 INFO L430 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 616266921, now seen corresponding path program 51 times [2021-06-05 22:14:46,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:46,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376928277] [2021-06-05 22:14:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:46,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:46,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376928277] [2021-06-05 22:14:46,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376928277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:46,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458437511] [2021-06-05 22:14:46,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:46,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:46,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:46,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:46,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:46,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458437511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:46,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:46,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:46,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497339152] [2021-06-05 22:14:46,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:46,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:46,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:46,931 INFO L87 Difference]: Start difference. First operand 258 states and 769 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:47,151 INFO L93 Difference]: Finished difference Result 455 states and 1280 transitions. [2021-06-05 22:14:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:47,152 INFO L225 Difference]: With dead ends: 455 [2021-06-05 22:14:47,152 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 22:14:47,152 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 217.3ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 22:14:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 258. [2021-06-05 22:14:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.9844357976653697) internal successors, (767), 257 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 767 transitions. [2021-06-05 22:14:47,155 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 767 transitions. Word has length 18 [2021-06-05 22:14:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:47,155 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 767 transitions. [2021-06-05 22:14:47,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 767 transitions. [2021-06-05 22:14:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:47,156 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:47,156 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:47,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable316 [2021-06-05 22:14:47,356 INFO L430 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1345274345, now seen corresponding path program 9 times [2021-06-05 22:14:47,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:47,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942249077] [2021-06-05 22:14:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:47,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:47,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942249077] [2021-06-05 22:14:47,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942249077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:47,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378336977] [2021-06-05 22:14:47,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:47,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:47,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:47,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:14:47,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:47,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378336977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:47,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:47,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-06-05 22:14:47,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114301532] [2021-06-05 22:14:47,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:14:47,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:14:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:14:47,447 INFO L87 Difference]: Start difference. First operand 258 states and 767 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:47,492 INFO L93 Difference]: Finished difference Result 393 states and 1148 transitions. [2021-06-05 22:14:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:47,492 INFO L225 Difference]: With dead ends: 393 [2021-06-05 22:14:47,492 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 22:14:47,493 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 22:14:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2021-06-05 22:14:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.9878048780487805) internal successors, (735), 246 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 735 transitions. [2021-06-05 22:14:47,495 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 735 transitions. Word has length 18 [2021-06-05 22:14:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:47,495 INFO L482 AbstractCegarLoop]: Abstraction has 247 states and 735 transitions. [2021-06-05 22:14:47,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 735 transitions. [2021-06-05 22:14:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:47,496 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:47,496 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:47,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable321 [2021-06-05 22:14:47,696 INFO L430 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:47,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1782534729, now seen corresponding path program 52 times [2021-06-05 22:14:47,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:47,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122293627] [2021-06-05 22:14:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:47,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:47,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122293627] [2021-06-05 22:14:47,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122293627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:47,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549994035] [2021-06-05 22:14:47,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:47,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:47,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:47,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:47,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549994035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:47,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:47,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:14:47,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153144038] [2021-06-05 22:14:47,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:47,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:47,849 INFO L87 Difference]: Start difference. First operand 247 states and 735 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:48,031 INFO L93 Difference]: Finished difference Result 487 states and 1353 transitions. [2021-06-05 22:14:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:48,032 INFO L225 Difference]: With dead ends: 487 [2021-06-05 22:14:48,032 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 22:14:48,032 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 170.1ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 22:14:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 253. [2021-06-05 22:14:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.0277777777777777) internal successors, (763), 252 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 763 transitions. [2021-06-05 22:14:48,035 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 763 transitions. Word has length 18 [2021-06-05 22:14:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:48,035 INFO L482 AbstractCegarLoop]: Abstraction has 253 states and 763 transitions. [2021-06-05 22:14:48,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 763 transitions. [2021-06-05 22:14:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:48,036 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:48,036 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:48,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable325 [2021-06-05 22:14:48,236 INFO L430 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1582271391, now seen corresponding path program 53 times [2021-06-05 22:14:48,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:48,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969200441] [2021-06-05 22:14:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:48,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:48,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969200441] [2021-06-05 22:14:48,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969200441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:48,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930556800] [2021-06-05 22:14:48,281 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:48,308 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:48,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:48,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:48,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:48,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930556800] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:48,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:48,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:48,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542818961] [2021-06-05 22:14:48,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:48,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:48,382 INFO L87 Difference]: Start difference. First operand 253 states and 763 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:48,557 INFO L93 Difference]: Finished difference Result 491 states and 1353 transitions. [2021-06-05 22:14:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:48,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:48,558 INFO L225 Difference]: With dead ends: 491 [2021-06-05 22:14:48,558 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 22:14:48,558 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 162.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 22:14:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 255. [2021-06-05 22:14:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.0078740157480315) internal successors, (764), 254 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 764 transitions. [2021-06-05 22:14:48,561 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 764 transitions. Word has length 18 [2021-06-05 22:14:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:48,561 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 764 transitions. [2021-06-05 22:14:48,561 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 764 transitions. [2021-06-05 22:14:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:48,562 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:48,562 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:48,771 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:48,772 INFO L430 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash -951095685, now seen corresponding path program 10 times [2021-06-05 22:14:48,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:48,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373706927] [2021-06-05 22:14:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:48,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:48,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373706927] [2021-06-05 22:14:48,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373706927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:48,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366242480] [2021-06-05 22:14:48,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:48,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:48,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:48,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:14:48,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:48,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366242480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:48,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:48,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-05 22:14:48,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949737518] [2021-06-05 22:14:48,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:14:48,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:14:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:14:48,898 INFO L87 Difference]: Start difference. First operand 255 states and 764 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:48,956 INFO L93 Difference]: Finished difference Result 360 states and 1024 transitions. [2021-06-05 22:14:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:48,957 INFO L225 Difference]: With dead ends: 360 [2021-06-05 22:14:48,957 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 22:14:48,957 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 22:14:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 249. [2021-06-05 22:14:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.971774193548387) internal successors, (737), 248 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 737 transitions. [2021-06-05 22:14:48,961 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 737 transitions. Word has length 18 [2021-06-05 22:14:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:48,961 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 737 transitions. [2021-06-05 22:14:48,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 737 transitions. [2021-06-05 22:14:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:48,962 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:48,962 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:49,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable333 [2021-06-05 22:14:49,169 INFO L430 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2053044421, now seen corresponding path program 54 times [2021-06-05 22:14:49,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:49,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754570699] [2021-06-05 22:14:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:49,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:49,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754570699] [2021-06-05 22:14:49,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754570699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:49,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101042307] [2021-06-05 22:14:49,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:49,251 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:49,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:49,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:49,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:49,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101042307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:49,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:49,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 22:14:49,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480605786] [2021-06-05 22:14:49,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 22:14:49,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 22:14:49,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:49,368 INFO L87 Difference]: Start difference. First operand 249 states and 737 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:49,573 INFO L93 Difference]: Finished difference Result 461 states and 1276 transitions. [2021-06-05 22:14:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:49,574 INFO L225 Difference]: With dead ends: 461 [2021-06-05 22:14:49,574 INFO L226 Difference]: Without dead ends: 442 [2021-06-05 22:14:49,574 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 225.0ms TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:14:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-06-05 22:14:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 246. [2021-06-05 22:14:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.9959183673469387) internal successors, (734), 245 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 734 transitions. [2021-06-05 22:14:49,578 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 734 transitions. Word has length 18 [2021-06-05 22:14:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:49,578 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 734 transitions. [2021-06-05 22:14:49,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 734 transitions. [2021-06-05 22:14:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:49,578 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:49,578 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:49,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:49,779 INFO L430 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:49,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1871915973, now seen corresponding path program 55 times [2021-06-05 22:14:49,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:49,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70515646] [2021-06-05 22:14:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:49,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:49,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70515646] [2021-06-05 22:14:49,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70515646] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:49,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290190056] [2021-06-05 22:14:49,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:49,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:49,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290190056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:49,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:49,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:49,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163612363] [2021-06-05 22:14:49,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:49,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:49,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:49,933 INFO L87 Difference]: Start difference. First operand 246 states and 734 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:50,080 INFO L93 Difference]: Finished difference Result 433 states and 1225 transitions. [2021-06-05 22:14:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:50,081 INFO L225 Difference]: With dead ends: 433 [2021-06-05 22:14:50,081 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:14:50,081 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 122.7ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:14:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 242. [2021-06-05 22:14:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.962655601659751) internal successors, (714), 241 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 714 transitions. [2021-06-05 22:14:50,084 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 714 transitions. Word has length 18 [2021-06-05 22:14:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:50,084 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 714 transitions. [2021-06-05 22:14:50,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 714 transitions. [2021-06-05 22:14:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:50,085 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:50,085 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:50,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:50,285 INFO L430 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:50,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:50,286 INFO L82 PathProgramCache]: Analyzing trace with hash -116472655, now seen corresponding path program 11 times [2021-06-05 22:14:50,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:50,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607385568] [2021-06-05 22:14:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:50,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:50,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607385568] [2021-06-05 22:14:50,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607385568] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:14:50,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:14:50,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:14:50,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083590271] [2021-06-05 22:14:50,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:14:50,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:14:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:14:50,325 INFO L87 Difference]: Start difference. First operand 242 states and 714 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:50,396 INFO L93 Difference]: Finished difference Result 287 states and 821 transitions. [2021-06-05 22:14:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 22:14:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:50,397 INFO L225 Difference]: With dead ends: 287 [2021-06-05 22:14:50,397 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 22:14:50,397 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.1ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 22:14:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2021-06-05 22:14:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.9330143540669855) internal successors, (613), 209 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 613 transitions. [2021-06-05 22:14:50,399 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 613 transitions. Word has length 18 [2021-06-05 22:14:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:50,399 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 613 transitions. [2021-06-05 22:14:50,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 613 transitions. [2021-06-05 22:14:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:50,399 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:50,399 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:50,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2021-06-05 22:14:50,400 INFO L430 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash -9376803, now seen corresponding path program 56 times [2021-06-05 22:14:50,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:50,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721804236] [2021-06-05 22:14:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:50,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:50,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721804236] [2021-06-05 22:14:50,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721804236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:50,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973969620] [2021-06-05 22:14:50,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:50,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:50,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:50,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:50,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973969620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:50,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:50,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 22:14:50,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774834661] [2021-06-05 22:14:50,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:50,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:50,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:50,560 INFO L87 Difference]: Start difference. First operand 210 states and 613 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:50,816 INFO L93 Difference]: Finished difference Result 427 states and 1174 transitions. [2021-06-05 22:14:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:50,817 INFO L225 Difference]: With dead ends: 427 [2021-06-05 22:14:50,817 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:14:50,817 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 248.7ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:14:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 218. [2021-06-05 22:14:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.9262672811059907) internal successors, (635), 217 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 635 transitions. [2021-06-05 22:14:50,819 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 635 transitions. Word has length 18 [2021-06-05 22:14:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:50,820 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 635 transitions. [2021-06-05 22:14:50,820 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 635 transitions. [2021-06-05 22:14:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:50,820 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:50,820 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:51,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable345 [2021-06-05 22:14:51,021 INFO L430 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash 969180641, now seen corresponding path program 57 times [2021-06-05 22:14:51,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:51,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35878759] [2021-06-05 22:14:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:51,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:51,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35878759] [2021-06-05 22:14:51,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35878759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:51,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299296602] [2021-06-05 22:14:51,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:51,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:51,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:51,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:51,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:51,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299296602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:51,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:51,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:51,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017787156] [2021-06-05 22:14:51,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:51,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:51,163 INFO L87 Difference]: Start difference. First operand 218 states and 635 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:51,348 INFO L93 Difference]: Finished difference Result 411 states and 1144 transitions. [2021-06-05 22:14:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:51,349 INFO L225 Difference]: With dead ends: 411 [2021-06-05 22:14:51,349 INFO L226 Difference]: Without dead ends: 392 [2021-06-05 22:14:51,349 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 171.5ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-06-05 22:14:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 209. [2021-06-05 22:14:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.923076923076923) internal successors, (608), 208 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 608 transitions. [2021-06-05 22:14:51,352 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 608 transitions. Word has length 18 [2021-06-05 22:14:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:51,352 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 608 transitions. [2021-06-05 22:14:51,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 608 transitions. [2021-06-05 22:14:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:51,352 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:51,352 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:51,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:51,553 INFO L430 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2131358893, now seen corresponding path program 58 times [2021-06-05 22:14:51,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:51,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127286873] [2021-06-05 22:14:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:51,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:51,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127286873] [2021-06-05 22:14:51,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127286873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:51,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206078378] [2021-06-05 22:14:51,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:51,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:51,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:51,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:51,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:51,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206078378] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:51,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:51,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:51,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231058477] [2021-06-05 22:14:51,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:51,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:51,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:51,682 INFO L87 Difference]: Start difference. First operand 209 states and 608 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:51,882 INFO L93 Difference]: Finished difference Result 371 states and 1026 transitions. [2021-06-05 22:14:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:51,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:51,882 INFO L225 Difference]: With dead ends: 371 [2021-06-05 22:14:51,882 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 22:14:51,882 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 200.0ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:14:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 22:14:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 211. [2021-06-05 22:14:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.919047619047619) internal successors, (613), 210 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 613 transitions. [2021-06-05 22:14:51,885 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 613 transitions. Word has length 18 [2021-06-05 22:14:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:51,885 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 613 transitions. [2021-06-05 22:14:51,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 613 transitions. [2021-06-05 22:14:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:51,886 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:51,886 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:52,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:52,086 INFO L430 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1750676137, now seen corresponding path program 59 times [2021-06-05 22:14:52,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:52,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527920788] [2021-06-05 22:14:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:52,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:52,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527920788] [2021-06-05 22:14:52,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527920788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:52,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422999425] [2021-06-05 22:14:52,134 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:52,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:52,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:52,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:52,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:52,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422999425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:52,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:52,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:52,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466895915] [2021-06-05 22:14:52,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:52,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:52,236 INFO L87 Difference]: Start difference. First operand 211 states and 613 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:52,460 INFO L93 Difference]: Finished difference Result 363 states and 1008 transitions. [2021-06-05 22:14:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:52,461 INFO L225 Difference]: With dead ends: 363 [2021-06-05 22:14:52,461 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 22:14:52,461 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 219.5ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 22:14:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 219. [2021-06-05 22:14:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.9128440366972477) internal successors, (635), 218 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 635 transitions. [2021-06-05 22:14:52,464 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 635 transitions. Word has length 18 [2021-06-05 22:14:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:52,464 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 635 transitions. [2021-06-05 22:14:52,464 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 635 transitions. [2021-06-05 22:14:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:52,464 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:52,464 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:52,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable358 [2021-06-05 22:14:52,681 INFO L430 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1565733715, now seen corresponding path program 60 times [2021-06-05 22:14:52,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:52,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767838916] [2021-06-05 22:14:52,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:52,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:52,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767838916] [2021-06-05 22:14:52,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767838916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:52,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859046889] [2021-06-05 22:14:52,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:52,762 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:52,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:52,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:52,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859046889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:52,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:52,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:52,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61446465] [2021-06-05 22:14:52,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:52,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:52,829 INFO L87 Difference]: Start difference. First operand 219 states and 635 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:53,036 INFO L93 Difference]: Finished difference Result 338 states and 956 transitions. [2021-06-05 22:14:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:53,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:53,037 INFO L225 Difference]: With dead ends: 338 [2021-06-05 22:14:53,037 INFO L226 Difference]: Without dead ends: 319 [2021-06-05 22:14:53,037 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 211.8ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:14:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-06-05 22:14:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2021-06-05 22:14:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.923076923076923) internal successors, (608), 208 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 608 transitions. [2021-06-05 22:14:53,039 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 608 transitions. Word has length 18 [2021-06-05 22:14:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:53,039 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 608 transitions. [2021-06-05 22:14:53,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 608 transitions. [2021-06-05 22:14:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:53,040 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:53,040 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:53,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:53,240 INFO L430 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2071414893, now seen corresponding path program 61 times [2021-06-05 22:14:53,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:53,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696476684] [2021-06-05 22:14:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:53,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:53,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696476684] [2021-06-05 22:14:53,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696476684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:53,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027299395] [2021-06-05 22:14:53,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:53,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:53,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:53,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027299395] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:53,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:53,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:53,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229875611] [2021-06-05 22:14:53,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:53,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:53,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:53,408 INFO L87 Difference]: Start difference. First operand 209 states and 608 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:53,632 INFO L93 Difference]: Finished difference Result 369 states and 1028 transitions. [2021-06-05 22:14:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:53,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:53,633 INFO L225 Difference]: With dead ends: 369 [2021-06-05 22:14:53,633 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 22:14:53,633 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 248.7ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 22:14:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 214. [2021-06-05 22:14:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.92018779342723) internal successors, (622), 213 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 622 transitions. [2021-06-05 22:14:53,635 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 622 transitions. Word has length 18 [2021-06-05 22:14:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:53,635 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 622 transitions. [2021-06-05 22:14:53,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 622 transitions. [2021-06-05 22:14:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:53,636 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:53,636 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:53,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable366 [2021-06-05 22:14:53,836 INFO L430 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2067720571, now seen corresponding path program 62 times [2021-06-05 22:14:53,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:53,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330785192] [2021-06-05 22:14:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:53,918 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:53,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330785192] [2021-06-05 22:14:53,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330785192] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:53,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927793761] [2021-06-05 22:14:53,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:53,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:53,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:53,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:53,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:54,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927793761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:54,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:54,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:54,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908461355] [2021-06-05 22:14:54,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:54,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:54,052 INFO L87 Difference]: Start difference. First operand 214 states and 622 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:54,329 INFO L93 Difference]: Finished difference Result 412 states and 1121 transitions. [2021-06-05 22:14:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:54,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:54,329 INFO L225 Difference]: With dead ends: 412 [2021-06-05 22:14:54,329 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 22:14:54,330 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 305.2ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 22:14:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2021-06-05 22:14:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.925581395348837) internal successors, (629), 215 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 629 transitions. [2021-06-05 22:14:54,332 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 629 transitions. Word has length 18 [2021-06-05 22:14:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:54,333 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 629 transitions. [2021-06-05 22:14:54,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 629 transitions. [2021-06-05 22:14:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:54,333 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:54,333 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:54,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 22:14:54,533 INFO L430 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1297085549, now seen corresponding path program 63 times [2021-06-05 22:14:54,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:54,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820478219] [2021-06-05 22:14:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:54,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:54,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820478219] [2021-06-05 22:14:54,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820478219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:54,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001601308] [2021-06-05 22:14:54,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:54,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:54,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:54,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:54,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001601308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:54,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:54,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:54,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437769827] [2021-06-05 22:14:54,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:54,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:54,710 INFO L87 Difference]: Start difference. First operand 216 states and 629 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:54,945 INFO L93 Difference]: Finished difference Result 375 states and 1035 transitions. [2021-06-05 22:14:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:54,946 INFO L225 Difference]: With dead ends: 375 [2021-06-05 22:14:54,946 INFO L226 Difference]: Without dead ends: 352 [2021-06-05 22:14:54,946 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 258.1ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-06-05 22:14:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 212. [2021-06-05 22:14:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.924170616113744) internal successors, (617), 211 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 22:14:54,949 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 22:14:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:54,949 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 22:14:54,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 22:14:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:54,949 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:54,949 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:55,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:55,150 INFO L430 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1181922291, now seen corresponding path program 64 times [2021-06-05 22:14:55,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:55,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000284083] [2021-06-05 22:14:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:55,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:55,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000284083] [2021-06-05 22:14:55,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000284083] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:55,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741569167] [2021-06-05 22:14:55,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:55,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:55,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:55,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:55,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:55,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741569167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:55,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:55,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:55,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507893626] [2021-06-05 22:14:55,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:55,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:55,344 INFO L87 Difference]: Start difference. First operand 212 states and 617 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:55,594 INFO L93 Difference]: Finished difference Result 392 states and 1071 transitions. [2021-06-05 22:14:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:55,595 INFO L225 Difference]: With dead ends: 392 [2021-06-05 22:14:55,595 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 22:14:55,595 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 276.5ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:14:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 22:14:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 216. [2021-06-05 22:14:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.9348837209302325) internal successors, (631), 215 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 631 transitions. [2021-06-05 22:14:55,598 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 631 transitions. Word has length 18 [2021-06-05 22:14:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:55,598 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 631 transitions. [2021-06-05 22:14:55,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 631 transitions. [2021-06-05 22:14:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:55,598 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:55,598 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:55,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:55,799 INFO L430 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2112083467, now seen corresponding path program 65 times [2021-06-05 22:14:55,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:55,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485539666] [2021-06-05 22:14:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:55,849 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:55,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485539666] [2021-06-05 22:14:55,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485539666] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:55,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127666132] [2021-06-05 22:14:55,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:55,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:55,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:55,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:55,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:55,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127666132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:55,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:55,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:55,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492088610] [2021-06-05 22:14:55,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:55,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:55,984 INFO L87 Difference]: Start difference. First operand 216 states and 631 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:56,238 INFO L93 Difference]: Finished difference Result 396 states and 1071 transitions. [2021-06-05 22:14:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:56,239 INFO L225 Difference]: With dead ends: 396 [2021-06-05 22:14:56,240 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 22:14:56,240 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 285.6ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 22:14:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 214. [2021-06-05 22:14:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.9295774647887325) internal successors, (624), 213 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 624 transitions. [2021-06-05 22:14:56,245 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 624 transitions. Word has length 18 [2021-06-05 22:14:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:56,245 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 624 transitions. [2021-06-05 22:14:56,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 624 transitions. [2021-06-05 22:14:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:56,245 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:56,246 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:56,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable380 [2021-06-05 22:14:56,461 INFO L430 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1099390935, now seen corresponding path program 66 times [2021-06-05 22:14:56,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:56,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052653269] [2021-06-05 22:14:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:56,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:56,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052653269] [2021-06-05 22:14:56,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052653269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:56,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661438985] [2021-06-05 22:14:56,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:56,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:56,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:56,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:56,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:56,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661438985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:56,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:56,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:14:56,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297414510] [2021-06-05 22:14:56,625 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:14:56,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:14:56,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:14:56,625 INFO L87 Difference]: Start difference. First operand 214 states and 624 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:56,861 INFO L93 Difference]: Finished difference Result 361 states and 998 transitions. [2021-06-05 22:14:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:56,862 INFO L225 Difference]: With dead ends: 361 [2021-06-05 22:14:56,862 INFO L226 Difference]: Without dead ends: 334 [2021-06-05 22:14:56,862 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 249.5ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-06-05 22:14:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 212. [2021-06-05 22:14:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.924170616113744) internal successors, (617), 211 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 22:14:56,865 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 22:14:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:56,865 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 22:14:56,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 22:14:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:56,866 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:56,866 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:57,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:57,066 INFO L430 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1459644047, now seen corresponding path program 67 times [2021-06-05 22:14:57,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:57,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852009217] [2021-06-05 22:14:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:57,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:57,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852009217] [2021-06-05 22:14:57,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852009217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:57,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180357557] [2021-06-05 22:14:57,118 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:57,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:57,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:57,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180357557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:57,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:57,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:57,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309301308] [2021-06-05 22:14:57,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:57,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:57,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:57,232 INFO L87 Difference]: Start difference. First operand 212 states and 617 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:57,439 INFO L93 Difference]: Finished difference Result 491 states and 1355 transitions. [2021-06-05 22:14:57,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:57,440 INFO L225 Difference]: With dead ends: 491 [2021-06-05 22:14:57,440 INFO L226 Difference]: Without dead ends: 472 [2021-06-05 22:14:57,440 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 213.5ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-06-05 22:14:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 218. [2021-06-05 22:14:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.9400921658986174) internal successors, (638), 217 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 638 transitions. [2021-06-05 22:14:57,443 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 638 transitions. Word has length 18 [2021-06-05 22:14:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:57,443 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 638 transitions. [2021-06-05 22:14:57,443 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 638 transitions. [2021-06-05 22:14:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:57,444 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:57,444 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:57,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:57,644 INFO L430 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1303812215, now seen corresponding path program 68 times [2021-06-05 22:14:57,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:57,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515297819] [2021-06-05 22:14:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:57,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:57,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515297819] [2021-06-05 22:14:57,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515297819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:57,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953289218] [2021-06-05 22:14:57,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:57,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:57,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:57,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:57,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:57,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953289218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:57,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:57,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:57,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150504807] [2021-06-05 22:14:57,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:57,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:57,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:57,814 INFO L87 Difference]: Start difference. First operand 218 states and 638 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:58,028 INFO L93 Difference]: Finished difference Result 526 states and 1428 transitions. [2021-06-05 22:14:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:58,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:58,029 INFO L225 Difference]: With dead ends: 526 [2021-06-05 22:14:58,029 INFO L226 Difference]: Without dead ends: 507 [2021-06-05 22:14:58,029 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 221.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-06-05 22:14:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 222. [2021-06-05 22:14:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.9592760180995477) internal successors, (654), 221 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 654 transitions. [2021-06-05 22:14:58,032 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 654 transitions. Word has length 18 [2021-06-05 22:14:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:58,033 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 654 transitions. [2021-06-05 22:14:58,033 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 654 transitions. [2021-06-05 22:14:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:58,033 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:58,033 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:58,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393,78 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:58,233 INFO L430 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2060993905, now seen corresponding path program 69 times [2021-06-05 22:14:58,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:58,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607560260] [2021-06-05 22:14:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:58,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:58,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607560260] [2021-06-05 22:14:58,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607560260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:58,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584559727] [2021-06-05 22:14:58,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:58,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:14:58,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:58,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:58,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:58,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584559727] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:58,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:58,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:58,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539068675] [2021-06-05 22:14:58,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:58,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:58,418 INFO L87 Difference]: Start difference. First operand 222 states and 654 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:58,630 INFO L93 Difference]: Finished difference Result 489 states and 1342 transitions. [2021-06-05 22:14:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:58,631 INFO L225 Difference]: With dead ends: 489 [2021-06-05 22:14:58,631 INFO L226 Difference]: Without dead ends: 466 [2021-06-05 22:14:58,631 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 236.8ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-06-05 22:14:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 222. [2021-06-05 22:14:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.9411764705882355) internal successors, (650), 221 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 650 transitions. [2021-06-05 22:14:58,634 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 650 transitions. Word has length 18 [2021-06-05 22:14:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:58,634 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 650 transitions. [2021-06-05 22:14:58,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 650 transitions. [2021-06-05 22:14:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:58,635 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:58,635 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:58,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:58,837 INFO L430 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1255509907, now seen corresponding path program 70 times [2021-06-05 22:14:58,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:58,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852918602] [2021-06-05 22:14:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:58,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:58,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852918602] [2021-06-05 22:14:58,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852918602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:58,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191604713] [2021-06-05 22:14:58,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:58,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:14:58,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:58,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:58,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:58,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191604713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:58,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:58,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:14:58,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843110505] [2021-06-05 22:14:58,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:14:58,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:14:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:14:58,998 INFO L87 Difference]: Start difference. First operand 222 states and 650 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:59,162 INFO L93 Difference]: Finished difference Result 452 states and 1260 transitions. [2021-06-05 22:14:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:59,163 INFO L225 Difference]: With dead ends: 452 [2021-06-05 22:14:59,163 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 22:14:59,163 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 170.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 22:14:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 22:14:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 217. [2021-06-05 22:14:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.949074074074074) internal successors, (637), 216 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 637 transitions. [2021-06-05 22:14:59,167 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 637 transitions. Word has length 18 [2021-06-05 22:14:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:59,167 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 637 transitions. [2021-06-05 22:14:59,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 637 transitions. [2021-06-05 22:14:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:59,167 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:59,167 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:59,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:59,383 INFO L430 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1030444307, now seen corresponding path program 71 times [2021-06-05 22:14:59,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:59,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922423984] [2021-06-05 22:14:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:59,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:59,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922423984] [2021-06-05 22:14:59,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922423984] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:59,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402170288] [2021-06-05 22:14:59,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:59,456 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:14:59,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:59,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:59,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:59,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402170288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:59,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:59,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:14:59,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518803000] [2021-06-05 22:14:59,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:14:59,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:14:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:14:59,531 INFO L87 Difference]: Start difference. First operand 217 states and 637 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:14:59,665 INFO L93 Difference]: Finished difference Result 433 states and 1227 transitions. [2021-06-05 22:14:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:14:59,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:14:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:14:59,666 INFO L225 Difference]: With dead ends: 433 [2021-06-05 22:14:59,666 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:14:59,666 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 131.8ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:14:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:14:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 221. [2021-06-05 22:14:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.9863636363636363) internal successors, (657), 220 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 657 transitions. [2021-06-05 22:14:59,669 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 657 transitions. Word has length 18 [2021-06-05 22:14:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:14:59,669 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 657 transitions. [2021-06-05 22:14:59,669 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:14:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 657 transitions. [2021-06-05 22:14:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:14:59,669 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:14:59,669 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:14:59,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable404 [2021-06-05 22:14:59,870 INFO L430 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:14:59,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:14:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash -668276081, now seen corresponding path program 72 times [2021-06-05 22:14:59,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:14:59,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708726095] [2021-06-05 22:14:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:14:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:14:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:59,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:14:59,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708726095] [2021-06-05 22:14:59,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708726095] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:59,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999407011] [2021-06-05 22:14:59,908 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:14:59,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:14:59,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:14:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:14:59,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:14:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:14:59,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999407011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:14:59,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:14:59,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:14:59,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050908972] [2021-06-05 22:14:59,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:14:59,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:14:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:14:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:14:59,991 INFO L87 Difference]: Start difference. First operand 221 states and 657 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:00,122 INFO L93 Difference]: Finished difference Result 404 states and 1161 transitions. [2021-06-05 22:15:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:00,123 INFO L225 Difference]: With dead ends: 404 [2021-06-05 22:15:00,123 INFO L226 Difference]: Without dead ends: 385 [2021-06-05 22:15:00,123 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 108.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-06-05 22:15:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 213. [2021-06-05 22:15:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.9292452830188678) internal successors, (621), 212 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 621 transitions. [2021-06-05 22:15:00,126 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 621 transitions. Word has length 18 [2021-06-05 22:15:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:00,126 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 621 transitions. [2021-06-05 22:15:00,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 621 transitions. [2021-06-05 22:15:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:00,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:00,127 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:00,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:00,341 INFO L430 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -188192517, now seen corresponding path program 73 times [2021-06-05 22:15:00,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:00,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509401164] [2021-06-05 22:15:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:00,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:00,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509401164] [2021-06-05 22:15:00,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509401164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:00,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904083774] [2021-06-05 22:15:00,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:00,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:00,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904083774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:00,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:00,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 22:15:00,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866726505] [2021-06-05 22:15:00,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:15:00,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:15:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:00,502 INFO L87 Difference]: Start difference. First operand 213 states and 621 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:00,684 INFO L93 Difference]: Finished difference Result 502 states and 1407 transitions. [2021-06-05 22:15:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:00,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:00,685 INFO L225 Difference]: With dead ends: 502 [2021-06-05 22:15:00,685 INFO L226 Difference]: Without dead ends: 483 [2021-06-05 22:15:00,685 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 186.2ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:15:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-06-05 22:15:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 219. [2021-06-05 22:15:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.9724770642201834) internal successors, (648), 218 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 648 transitions. [2021-06-05 22:15:00,688 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 648 transitions. Word has length 18 [2021-06-05 22:15:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:00,689 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 648 transitions. [2021-06-05 22:15:00,689 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 648 transitions. [2021-06-05 22:15:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:00,689 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:00,689 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:00,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable410 [2021-06-05 22:15:00,889 INFO L430 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 741968659, now seen corresponding path program 74 times [2021-06-05 22:15:00,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:00,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681278312] [2021-06-05 22:15:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:00,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:00,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681278312] [2021-06-05 22:15:00,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681278312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:00,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607537990] [2021-06-05 22:15:00,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:00,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:00,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:00,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:00,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:01,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607537990] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:01,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:01,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 22:15:01,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36568488] [2021-06-05 22:15:01,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:15:01,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:15:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:01,050 INFO L87 Difference]: Start difference. First operand 219 states and 648 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:01,223 INFO L93 Difference]: Finished difference Result 490 states and 1367 transitions. [2021-06-05 22:15:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:01,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:01,224 INFO L225 Difference]: With dead ends: 490 [2021-06-05 22:15:01,224 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 22:15:01,224 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 177.3ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:15:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 22:15:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 221. [2021-06-05 22:15:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.95) internal successors, (649), 220 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 649 transitions. [2021-06-05 22:15:01,227 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 649 transitions. Word has length 18 [2021-06-05 22:15:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:01,227 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 649 transitions. [2021-06-05 22:15:01,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 649 transitions. [2021-06-05 22:15:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:01,227 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:01,227 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:01,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:01,428 INFO L430 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash 82317175, now seen corresponding path program 75 times [2021-06-05 22:15:01,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:01,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375396887] [2021-06-05 22:15:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:01,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:01,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375396887] [2021-06-05 22:15:01,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375396887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:01,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719707964] [2021-06-05 22:15:01,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:01,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:01,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:01,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:01,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:01,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719707964] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:01,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:01,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 22:15:01,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166677578] [2021-06-05 22:15:01,596 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 22:15:01,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 22:15:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:01,596 INFO L87 Difference]: Start difference. First operand 221 states and 649 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:01,833 INFO L93 Difference]: Finished difference Result 505 states and 1410 transitions. [2021-06-05 22:15:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:01,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:01,834 INFO L225 Difference]: With dead ends: 505 [2021-06-05 22:15:01,834 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 22:15:01,834 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 216.4ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:15:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 22:15:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 218. [2021-06-05 22:15:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.9769585253456223) internal successors, (646), 217 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2021-06-05 22:15:01,837 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 18 [2021-06-05 22:15:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:01,837 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2021-06-05 22:15:01,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2021-06-05 22:15:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:01,838 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:01,838 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:02,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable418 [2021-06-05 22:15:02,038 INFO L430 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -98811273, now seen corresponding path program 76 times [2021-06-05 22:15:02,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:02,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29626023] [2021-06-05 22:15:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:02,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:02,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29626023] [2021-06-05 22:15:02,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29626023] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:02,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537905943] [2021-06-05 22:15:02,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:02,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:02,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:02,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:02,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:02,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537905943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:02,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:02,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:02,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713850467] [2021-06-05 22:15:02,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:02,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:02,177 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:02,300 INFO L93 Difference]: Finished difference Result 486 states and 1381 transitions. [2021-06-05 22:15:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:02,301 INFO L225 Difference]: With dead ends: 486 [2021-06-05 22:15:02,301 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 22:15:02,301 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 22:15:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 214. [2021-06-05 22:15:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.9389671361502345) internal successors, (626), 213 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 626 transitions. [2021-06-05 22:15:02,304 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 626 transitions. Word has length 18 [2021-06-05 22:15:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:02,304 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 626 transitions. [2021-06-05 22:15:02,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 626 transitions. [2021-06-05 22:15:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:02,304 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:02,304 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:02,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable422 [2021-06-05 22:15:02,505 INFO L430 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1980104049, now seen corresponding path program 77 times [2021-06-05 22:15:02,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:02,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990458832] [2021-06-05 22:15:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:02,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:02,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990458832] [2021-06-05 22:15:02,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990458832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:02,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676879328] [2021-06-05 22:15:02,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:02,632 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:02,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:02,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:02,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:02,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676879328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:02,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:02,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:02,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879397898] [2021-06-05 22:15:02,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:02,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:02,713 INFO L87 Difference]: Start difference. First operand 214 states and 626 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:02,923 INFO L93 Difference]: Finished difference Result 443 states and 1246 transitions. [2021-06-05 22:15:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:02,924 INFO L225 Difference]: With dead ends: 443 [2021-06-05 22:15:02,924 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 22:15:02,924 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 183.8ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 22:15:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 222. [2021-06-05 22:15:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.932126696832579) internal successors, (648), 221 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 648 transitions. [2021-06-05 22:15:02,927 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 648 transitions. Word has length 18 [2021-06-05 22:15:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:02,927 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 648 transitions. [2021-06-05 22:15:02,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 648 transitions. [2021-06-05 22:15:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:02,927 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:02,927 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:03,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable425 [2021-06-05 22:15:03,141 INFO L430 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1001546605, now seen corresponding path program 78 times [2021-06-05 22:15:03,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:03,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153822319] [2021-06-05 22:15:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:03,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:03,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153822319] [2021-06-05 22:15:03,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153822319] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:03,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981825197] [2021-06-05 22:15:03,186 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:03,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:03,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:03,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:03,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:03,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981825197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:03,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:03,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:03,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093565160] [2021-06-05 22:15:03,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:03,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:03,281 INFO L87 Difference]: Start difference. First operand 222 states and 648 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:03,471 INFO L93 Difference]: Finished difference Result 427 states and 1216 transitions. [2021-06-05 22:15:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:03,472 INFO L225 Difference]: With dead ends: 427 [2021-06-05 22:15:03,472 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 22:15:03,472 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 177.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 22:15:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 212. [2021-06-05 22:15:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.924170616113744) internal successors, (617), 211 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 22:15:03,476 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 22:15:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:03,476 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 22:15:03,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 22:15:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:03,476 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:03,476 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:03,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable430 [2021-06-05 22:15:03,677 INFO L430 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2120551441, now seen corresponding path program 79 times [2021-06-05 22:15:03,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:03,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803597819] [2021-06-05 22:15:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:03,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:03,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803597819] [2021-06-05 22:15:03,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803597819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:03,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381332636] [2021-06-05 22:15:03,747 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:03,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:03,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:03,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381332636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:03,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:03,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:15:03,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314277566] [2021-06-05 22:15:03,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:15:03,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:15:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:03,846 INFO L87 Difference]: Start difference. First operand 212 states and 617 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:04,096 INFO L93 Difference]: Finished difference Result 424 states and 1183 transitions. [2021-06-05 22:15:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:04,097 INFO L225 Difference]: With dead ends: 424 [2021-06-05 22:15:04,097 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 22:15:04,097 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 22:15:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 22:15:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 217. [2021-06-05 22:15:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.9444444444444446) internal successors, (636), 216 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 636 transitions. [2021-06-05 22:15:04,100 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 636 transitions. Word has length 18 [2021-06-05 22:15:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:04,100 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 636 transitions. [2021-06-05 22:15:04,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 636 transitions. [2021-06-05 22:15:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:04,101 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:04,101 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:04,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable433 [2021-06-05 22:15:04,305 INFO L430 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1190390265, now seen corresponding path program 80 times [2021-06-05 22:15:04,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:04,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076240052] [2021-06-05 22:15:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:04,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:04,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076240052] [2021-06-05 22:15:04,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076240052] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:04,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923994657] [2021-06-05 22:15:04,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:04,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:04,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:04,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:04,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:04,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923994657] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:04,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:04,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:04,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911145939] [2021-06-05 22:15:04,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:04,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:04,455 INFO L87 Difference]: Start difference. First operand 217 states and 636 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:04,712 INFO L93 Difference]: Finished difference Result 428 states and 1183 transitions. [2021-06-05 22:15:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:04,712 INFO L225 Difference]: With dead ends: 428 [2021-06-05 22:15:04,712 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 22:15:04,713 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 233.4ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:15:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 22:15:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 215. [2021-06-05 22:15:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.939252336448598) internal successors, (629), 214 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 629 transitions. [2021-06-05 22:15:04,715 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 629 transitions. Word has length 18 [2021-06-05 22:15:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:04,715 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 629 transitions. [2021-06-05 22:15:04,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 629 transitions. [2021-06-05 22:15:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:04,716 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:04,716 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:04,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:04,916 INFO L430 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2091884499, now seen corresponding path program 81 times [2021-06-05 22:15:04,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:04,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159916233] [2021-06-05 22:15:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:04,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:04,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159916233] [2021-06-05 22:15:04,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159916233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:04,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689096240] [2021-06-05 22:15:04,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:04,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:04,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:04,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:04,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:05,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689096240] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:05,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:05,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:15:05,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379161626] [2021-06-05 22:15:05,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:05,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:05,078 INFO L87 Difference]: Start difference. First operand 215 states and 629 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:05,298 INFO L93 Difference]: Finished difference Result 422 states and 1164 transitions. [2021-06-05 22:15:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:05,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:05,299 INFO L225 Difference]: With dead ends: 422 [2021-06-05 22:15:05,299 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 22:15:05,299 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 226.2ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 22:15:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 213. [2021-06-05 22:15:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.9339622641509435) internal successors, (622), 212 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 622 transitions. [2021-06-05 22:15:05,302 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 622 transitions. Word has length 18 [2021-06-05 22:15:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:05,302 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 622 transitions. [2021-06-05 22:15:05,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 622 transitions. [2021-06-05 22:15:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:05,302 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:05,302 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:05,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable441 [2021-06-05 22:15:05,505 INFO L430 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1036814989, now seen corresponding path program 82 times [2021-06-05 22:15:05,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:05,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824997241] [2021-06-05 22:15:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:05,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:05,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824997241] [2021-06-05 22:15:05,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824997241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:05,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461277508] [2021-06-05 22:15:05,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:05,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:05,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:05,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:05,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:05,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461277508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:05,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:05,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 22:15:05,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295992835] [2021-06-05 22:15:05,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 22:15:05,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 22:15:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:05,703 INFO L87 Difference]: Start difference. First operand 213 states and 622 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:05,914 INFO L93 Difference]: Finished difference Result 441 states and 1207 transitions. [2021-06-05 22:15:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:05,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:05,915 INFO L225 Difference]: With dead ends: 441 [2021-06-05 22:15:05,915 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 22:15:05,915 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 190.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:15:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 22:15:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 219. [2021-06-05 22:15:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.977064220183486) internal successors, (649), 218 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 649 transitions. [2021-06-05 22:15:05,918 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 649 transitions. Word has length 18 [2021-06-05 22:15:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:05,918 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 649 transitions. [2021-06-05 22:15:05,918 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 649 transitions. [2021-06-05 22:15:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:05,918 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:05,918 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:06,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable446 [2021-06-05 22:15:06,119 INFO L430 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash -106653813, now seen corresponding path program 83 times [2021-06-05 22:15:06,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:06,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335861078] [2021-06-05 22:15:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:06,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:06,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335861078] [2021-06-05 22:15:06,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335861078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:06,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167075111] [2021-06-05 22:15:06,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:06,198 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:06,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:06,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:06,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:06,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167075111] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:06,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:06,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:06,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629913154] [2021-06-05 22:15:06,277 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:06,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:06,277 INFO L87 Difference]: Start difference. First operand 219 states and 649 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:06,462 INFO L93 Difference]: Finished difference Result 445 states and 1207 transitions. [2021-06-05 22:15:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:06,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:06,463 INFO L225 Difference]: With dead ends: 445 [2021-06-05 22:15:06,463 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 22:15:06,463 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 169.2ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 22:15:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 221. [2021-06-05 22:15:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.9545454545454546) internal successors, (650), 220 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 650 transitions. [2021-06-05 22:15:06,466 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 650 transitions. Word has length 18 [2021-06-05 22:15:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:06,466 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 650 transitions. [2021-06-05 22:15:06,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 650 transitions. [2021-06-05 22:15:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:06,467 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:06,467 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:06,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:06,667 INFO L430 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -766305297, now seen corresponding path program 84 times [2021-06-05 22:15:06,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:06,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993089213] [2021-06-05 22:15:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:06,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:06,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993089213] [2021-06-05 22:15:06,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993089213] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:06,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204868283] [2021-06-05 22:15:06,721 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:06,750 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:06,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:06,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:06,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:06,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204868283] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:06,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:06,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 22:15:06,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260601746] [2021-06-05 22:15:06,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 22:15:06,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 22:15:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:06,838 INFO L87 Difference]: Start difference. First operand 221 states and 650 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:07,043 INFO L93 Difference]: Finished difference Result 414 states and 1142 transitions. [2021-06-05 22:15:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:07,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:07,044 INFO L225 Difference]: With dead ends: 414 [2021-06-05 22:15:07,044 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 22:15:07,044 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 214.2ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:15:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 22:15:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 218. [2021-06-05 22:15:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.9815668202764978) internal successors, (647), 217 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 647 transitions. [2021-06-05 22:15:07,047 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 647 transitions. Word has length 18 [2021-06-05 22:15:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:07,047 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 647 transitions. [2021-06-05 22:15:07,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 647 transitions. [2021-06-05 22:15:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:07,048 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:07,048 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:07,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable454 [2021-06-05 22:15:07,248 INFO L430 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -947433745, now seen corresponding path program 85 times [2021-06-05 22:15:07,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:07,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766134849] [2021-06-05 22:15:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:07,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:07,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766134849] [2021-06-05 22:15:07,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766134849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:07,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253016902] [2021-06-05 22:15:07,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:07,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:07,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:07,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253016902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:07,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:07,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:07,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486149254] [2021-06-05 22:15:07,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:07,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:07,390 INFO L87 Difference]: Start difference. First operand 218 states and 647 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:07,538 INFO L93 Difference]: Finished difference Result 386 states and 1091 transitions. [2021-06-05 22:15:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:07,539 INFO L225 Difference]: With dead ends: 386 [2021-06-05 22:15:07,539 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 22:15:07,539 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 22:15:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 214. [2021-06-05 22:15:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.943661971830986) internal successors, (627), 213 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 627 transitions. [2021-06-05 22:15:07,542 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 627 transitions. Word has length 18 [2021-06-05 22:15:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:07,542 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 627 transitions. [2021-06-05 22:15:07,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 627 transitions. [2021-06-05 22:15:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:07,542 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:07,542 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:07,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458,95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:07,743 INFO L430 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1466240775, now seen corresponding path program 86 times [2021-06-05 22:15:07,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:07,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060965325] [2021-06-05 22:15:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:07,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:07,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060965325] [2021-06-05 22:15:07,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060965325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:07,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156106056] [2021-06-05 22:15:07,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:07,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:07,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:07,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:07,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:07,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156106056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:07,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:07,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 22:15:07,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450212634] [2021-06-05 22:15:07,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 22:15:07,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 22:15:07,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:07,906 INFO L87 Difference]: Start difference. First operand 214 states and 627 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:08,155 INFO L93 Difference]: Finished difference Result 422 states and 1166 transitions. [2021-06-05 22:15:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:08,156 INFO L225 Difference]: With dead ends: 422 [2021-06-05 22:15:08,156 INFO L226 Difference]: Without dead ends: 399 [2021-06-05 22:15:08,156 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 244.2ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-06-05 22:15:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-06-05 22:15:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 222. [2021-06-05 22:15:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.936651583710407) internal successors, (649), 221 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 649 transitions. [2021-06-05 22:15:08,159 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 649 transitions. Word has length 18 [2021-06-05 22:15:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:08,159 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 649 transitions. [2021-06-05 22:15:08,159 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 649 transitions. [2021-06-05 22:15:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:08,160 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:08,160 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:08,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461,96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:08,360 INFO L430 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1850169077, now seen corresponding path program 87 times [2021-06-05 22:15:08,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:08,361 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826358478] [2021-06-05 22:15:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:08,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:08,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826358478] [2021-06-05 22:15:08,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826358478] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:08,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147103434] [2021-06-05 22:15:08,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:08,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:08,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:08,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:08,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:08,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147103434] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:08,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:08,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:08,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600092130] [2021-06-05 22:15:08,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:08,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:08,518 INFO L87 Difference]: Start difference. First operand 222 states and 649 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:08,696 INFO L93 Difference]: Finished difference Result 406 states and 1136 transitions. [2021-06-05 22:15:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:08,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:08,696 INFO L225 Difference]: With dead ends: 406 [2021-06-05 22:15:08,696 INFO L226 Difference]: Without dead ends: 387 [2021-06-05 22:15:08,697 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 170.4ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-06-05 22:15:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2021-06-05 22:15:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.9339622641509435) internal successors, (622), 212 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 622 transitions. [2021-06-05 22:15:08,699 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 622 transitions. Word has length 18 [2021-06-05 22:15:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:08,700 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 622 transitions. [2021-06-05 22:15:08,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 622 transitions. [2021-06-05 22:15:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:08,700 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:08,700 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:08,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable466 [2021-06-05 22:15:08,900 INFO L430 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -687990825, now seen corresponding path program 88 times [2021-06-05 22:15:08,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:08,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108820294] [2021-06-05 22:15:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:08,946 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:08,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108820294] [2021-06-05 22:15:08,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108820294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:08,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154705115] [2021-06-05 22:15:08,946 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:08,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:08,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:08,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:08,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:09,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154705115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:09,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:09,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 22:15:09,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222929085] [2021-06-05 22:15:09,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:09,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:09,042 INFO L87 Difference]: Start difference. First operand 213 states and 622 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:09,251 INFO L93 Difference]: Finished difference Result 366 states and 1018 transitions. [2021-06-05 22:15:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:09,252 INFO L225 Difference]: With dead ends: 366 [2021-06-05 22:15:09,252 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 22:15:09,252 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 199.0ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 22:15:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 215. [2021-06-05 22:15:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.9299065420560746) internal successors, (627), 214 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 627 transitions. [2021-06-05 22:15:09,255 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 627 transitions. Word has length 18 [2021-06-05 22:15:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:09,255 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 627 transitions. [2021-06-05 22:15:09,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 627 transitions. [2021-06-05 22:15:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:09,255 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:09,255 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:09,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable469 [2021-06-05 22:15:09,456 INFO L430 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1068673581, now seen corresponding path program 89 times [2021-06-05 22:15:09,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:09,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693117644] [2021-06-05 22:15:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:09,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:09,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693117644] [2021-06-05 22:15:09,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693117644] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:09,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272079379] [2021-06-05 22:15:09,502 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:09,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:09,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:09,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:09,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:09,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272079379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:09,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:09,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:09,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734006213] [2021-06-05 22:15:09,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:09,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:09,607 INFO L87 Difference]: Start difference. First operand 215 states and 627 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:09,836 INFO L93 Difference]: Finished difference Result 358 states and 1000 transitions. [2021-06-05 22:15:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:09,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:09,837 INFO L225 Difference]: With dead ends: 358 [2021-06-05 22:15:09,837 INFO L226 Difference]: Without dead ends: 335 [2021-06-05 22:15:09,837 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 216.7ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:15:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-06-05 22:15:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 223. [2021-06-05 22:15:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.9234234234234235) internal successors, (649), 222 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 649 transitions. [2021-06-05 22:15:09,839 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 649 transitions. Word has length 18 [2021-06-05 22:15:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:09,840 INFO L482 AbstractCegarLoop]: Abstraction has 223 states and 649 transitions. [2021-06-05 22:15:09,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 649 transitions. [2021-06-05 22:15:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 22:15:09,840 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:09,840 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:10,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:10,041 INFO L430 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -90116137, now seen corresponding path program 90 times [2021-06-05 22:15:10,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:10,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972236790] [2021-06-05 22:15:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:10,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:10,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972236790] [2021-06-05 22:15:10,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972236790] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:10,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958601402] [2021-06-05 22:15:10,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:10,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:10,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:10,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 22:15:10,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:10,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958601402] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:10,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:10,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 22:15:10,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679805816] [2021-06-05 22:15:10,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:10,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:10,186 INFO L87 Difference]: Start difference. First operand 223 states and 649 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:10,404 INFO L93 Difference]: Finished difference Result 333 states and 948 transitions. [2021-06-05 22:15:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 22:15:10,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 22:15:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:10,405 INFO L225 Difference]: With dead ends: 333 [2021-06-05 22:15:10,405 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 22:15:10,405 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 205.2ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 22:15:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 22:15:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2021-06-05 22:15:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.924170616113744) internal successors, (617), 211 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 22:15:10,408 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 22:15:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:10,408 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 22:15:10,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 22:15:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:10,408 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:10,408 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:10,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable479 [2021-06-05 22:15:10,609 INFO L430 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -41149670, now seen corresponding path program 1 times [2021-06-05 22:15:10,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:10,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53117565] [2021-06-05 22:15:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:10,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:10,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53117565] [2021-06-05 22:15:10,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53117565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:10,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96769329] [2021-06-05 22:15:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:10,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:10,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96769329] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:10,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:10,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:10,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036358339] [2021-06-05 22:15:10,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:10,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:10,709 INFO L87 Difference]: Start difference. First operand 212 states and 617 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:10,783 INFO L93 Difference]: Finished difference Result 306 states and 874 transitions. [2021-06-05 22:15:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:10,783 INFO L225 Difference]: With dead ends: 306 [2021-06-05 22:15:10,783 INFO L226 Difference]: Without dead ends: 282 [2021-06-05 22:15:10,783 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-06-05 22:15:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 219. [2021-06-05 22:15:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.926605504587156) internal successors, (638), 218 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 638 transitions. [2021-06-05 22:15:10,786 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 638 transitions. Word has length 19 [2021-06-05 22:15:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:10,786 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 638 transitions. [2021-06-05 22:15:10,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 638 transitions. [2021-06-05 22:15:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:10,786 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:10,786 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:10,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:10,987 INFO L430 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -125197293, now seen corresponding path program 1 times [2021-06-05 22:15:10,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:10,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745699360] [2021-06-05 22:15:10,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:11,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745699360] [2021-06-05 22:15:11,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745699360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459421336] [2021-06-05 22:15:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:11,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:11,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459421336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:11,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:11,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915694580] [2021-06-05 22:15:11,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:11,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:11,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:11,082 INFO L87 Difference]: Start difference. First operand 219 states and 638 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:11,159 INFO L93 Difference]: Finished difference Result 359 states and 1037 transitions. [2021-06-05 22:15:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:11,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:11,160 INFO L225 Difference]: With dead ends: 359 [2021-06-05 22:15:11,160 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 22:15:11,160 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 22:15:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 230. [2021-06-05 22:15:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.978165938864629) internal successors, (682), 229 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 682 transitions. [2021-06-05 22:15:11,164 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 682 transitions. Word has length 19 [2021-06-05 22:15:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:11,164 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 682 transitions. [2021-06-05 22:15:11,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 682 transitions. [2021-06-05 22:15:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:11,165 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:11,165 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:11,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable485 [2021-06-05 22:15:11,389 INFO L430 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -470014277, now seen corresponding path program 2 times [2021-06-05 22:15:11,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:11,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904337947] [2021-06-05 22:15:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:11,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904337947] [2021-06-05 22:15:11,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904337947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142575726] [2021-06-05 22:15:11,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:11,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:11,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:11,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:11,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142575726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:11,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:11,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3843324] [2021-06-05 22:15:11,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:11,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:11,489 INFO L87 Difference]: Start difference. First operand 230 states and 682 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:11,582 INFO L93 Difference]: Finished difference Result 371 states and 1061 transitions. [2021-06-05 22:15:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:11,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:11,583 INFO L225 Difference]: With dead ends: 371 [2021-06-05 22:15:11,583 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 22:15:11,583 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 22:15:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 246. [2021-06-05 22:15:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.012244897959184) internal successors, (738), 245 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 22:15:11,586 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 22:15:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:11,586 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 22:15:11,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 22:15:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:11,586 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:11,586 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:11,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable486 [2021-06-05 22:15:11,787 INFO L430 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -438067324, now seen corresponding path program 2 times [2021-06-05 22:15:11,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:11,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380288941] [2021-06-05 22:15:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:11,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380288941] [2021-06-05 22:15:11,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380288941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454444630] [2021-06-05 22:15:11,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:11,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:11,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:11,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:11,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:11,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454444630] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:11,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:11,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:11,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739354844] [2021-06-05 22:15:11,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:11,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:11,902 INFO L87 Difference]: Start difference. First operand 246 states and 738 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:11,995 INFO L93 Difference]: Finished difference Result 360 states and 1044 transitions. [2021-06-05 22:15:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:11,996 INFO L225 Difference]: With dead ends: 360 [2021-06-05 22:15:11,996 INFO L226 Difference]: Without dead ends: 360 [2021-06-05 22:15:11,996 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 81.2ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-06-05 22:15:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 250. [2021-06-05 22:15:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0281124497991967) internal successors, (754), 249 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 754 transitions. [2021-06-05 22:15:11,999 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 754 transitions. Word has length 19 [2021-06-05 22:15:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:11,999 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 754 transitions. [2021-06-05 22:15:11,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 754 transitions. [2021-06-05 22:15:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:11,999 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:11,999 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:12,211 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable489 [2021-06-05 22:15:12,211 INFO L430 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1984931892, now seen corresponding path program 3 times [2021-06-05 22:15:12,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:12,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372768484] [2021-06-05 22:15:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:12,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:12,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372768484] [2021-06-05 22:15:12,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372768484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:12,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247368151] [2021-06-05 22:15:12,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:12,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:12,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:12,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:12,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:12,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247368151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:12,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:12,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:12,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093314011] [2021-06-05 22:15:12,407 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:12,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:12,407 INFO L87 Difference]: Start difference. First operand 250 states and 754 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:12,493 INFO L93 Difference]: Finished difference Result 330 states and 966 transitions. [2021-06-05 22:15:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:12,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:12,494 INFO L225 Difference]: With dead ends: 330 [2021-06-05 22:15:12,494 INFO L226 Difference]: Without dead ends: 321 [2021-06-05 22:15:12,494 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.0ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-06-05 22:15:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 250. [2021-06-05 22:15:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0120481927710845) internal successors, (750), 249 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 750 transitions. [2021-06-05 22:15:12,497 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 750 transitions. Word has length 19 [2021-06-05 22:15:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:12,497 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 750 transitions. [2021-06-05 22:15:12,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 750 transitions. [2021-06-05 22:15:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:12,497 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:12,497 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:12,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable490 [2021-06-05 22:15:12,698 INFO L430 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 9270399, now seen corresponding path program 3 times [2021-06-05 22:15:12,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:12,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408740642] [2021-06-05 22:15:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:12,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:12,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408740642] [2021-06-05 22:15:12,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408740642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:12,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159055784] [2021-06-05 22:15:12,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:12,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:12,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:12,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:12,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:12,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159055784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:12,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:12,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:12,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814769538] [2021-06-05 22:15:12,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:12,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:12,801 INFO L87 Difference]: Start difference. First operand 250 states and 750 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:12,894 INFO L93 Difference]: Finished difference Result 351 states and 1024 transitions. [2021-06-05 22:15:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:12,895 INFO L225 Difference]: With dead ends: 351 [2021-06-05 22:15:12,895 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 22:15:12,895 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 22:15:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 238. [2021-06-05 22:15:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.9957805907172994) internal successors, (710), 237 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 710 transitions. [2021-06-05 22:15:12,898 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 710 transitions. Word has length 19 [2021-06-05 22:15:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:12,898 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 710 transitions. [2021-06-05 22:15:12,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 710 transitions. [2021-06-05 22:15:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:12,898 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:12,898 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:13,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493,106 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:13,099 INFO L430 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 916771049, now seen corresponding path program 4 times [2021-06-05 22:15:13,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:13,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185407577] [2021-06-05 22:15:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:13,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185407577] [2021-06-05 22:15:13,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185407577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411200701] [2021-06-05 22:15:13,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:13,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:13,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:13,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411200701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:13,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:13,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209957613] [2021-06-05 22:15:13,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:13,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:13,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:13,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:13,200 INFO L87 Difference]: Start difference. First operand 238 states and 710 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:13,285 INFO L93 Difference]: Finished difference Result 321 states and 937 transitions. [2021-06-05 22:15:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:13,286 INFO L225 Difference]: With dead ends: 321 [2021-06-05 22:15:13,286 INFO L226 Difference]: Without dead ends: 305 [2021-06-05 22:15:13,286 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-06-05 22:15:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2021-06-05 22:15:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.995850622406639) internal successors, (722), 241 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 722 transitions. [2021-06-05 22:15:13,289 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 722 transitions. Word has length 19 [2021-06-05 22:15:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:13,289 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 722 transitions. [2021-06-05 22:15:13,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 722 transitions. [2021-06-05 22:15:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:13,289 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:13,289 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:13,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:13,490 INFO L430 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash 178079258, now seen corresponding path program 4 times [2021-06-05 22:15:13,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:13,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640478210] [2021-06-05 22:15:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:13,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640478210] [2021-06-05 22:15:13,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640478210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041164117] [2021-06-05 22:15:13,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:13,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:13,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:13,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:13,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041164117] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:13,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:13,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520499197] [2021-06-05 22:15:13,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:13,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:13,585 INFO L87 Difference]: Start difference. First operand 242 states and 722 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:13,672 INFO L93 Difference]: Finished difference Result 379 states and 1110 transitions. [2021-06-05 22:15:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:13,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:13,673 INFO L225 Difference]: With dead ends: 379 [2021-06-05 22:15:13,673 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 22:15:13,673 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 22:15:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 246. [2021-06-05 22:15:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.012244897959184) internal successors, (738), 245 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 22:15:13,676 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 22:15:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:13,676 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 22:15:13,676 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 22:15:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:13,676 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:13,676 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:13,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable497 [2021-06-05 22:15:13,877 INFO L430 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 117731045, now seen corresponding path program 5 times [2021-06-05 22:15:13,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:13,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697942099] [2021-06-05 22:15:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:13,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697942099] [2021-06-05 22:15:13,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697942099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620378330] [2021-06-05 22:15:13,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:13,937 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:13,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:13,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:13,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:13,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620378330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:13,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:13,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:13,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387795752] [2021-06-05 22:15:13,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:13,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:13,992 INFO L87 Difference]: Start difference. First operand 246 states and 738 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:14,086 INFO L93 Difference]: Finished difference Result 372 states and 1080 transitions. [2021-06-05 22:15:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:14,087 INFO L225 Difference]: With dead ends: 372 [2021-06-05 22:15:14,087 INFO L226 Difference]: Without dead ends: 364 [2021-06-05 22:15:14,087 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-06-05 22:15:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 262. [2021-06-05 22:15:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0421455938697317) internal successors, (794), 261 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 794 transitions. [2021-06-05 22:15:14,090 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 794 transitions. Word has length 19 [2021-06-05 22:15:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:14,090 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 794 transitions. [2021-06-05 22:15:14,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 794 transitions. [2021-06-05 22:15:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:14,091 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:14,091 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:14,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 109 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable498 [2021-06-05 22:15:14,291 INFO L430 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash 149677998, now seen corresponding path program 5 times [2021-06-05 22:15:14,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:14,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738848750] [2021-06-05 22:15:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:14,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:14,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738848750] [2021-06-05 22:15:14,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738848750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:14,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873087493] [2021-06-05 22:15:14,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:14,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:14,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:14,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:14,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:14,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873087493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:14,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:14,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:14,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678434830] [2021-06-05 22:15:14,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:14,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:14,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:14,399 INFO L87 Difference]: Start difference. First operand 262 states and 794 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:14,497 INFO L93 Difference]: Finished difference Result 408 states and 1192 transitions. [2021-06-05 22:15:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:14,498 INFO L225 Difference]: With dead ends: 408 [2021-06-05 22:15:14,498 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 22:15:14,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 22:15:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 262. [2021-06-05 22:15:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0421455938697317) internal successors, (794), 261 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 794 transitions. [2021-06-05 22:15:14,502 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 794 transitions. Word has length 19 [2021-06-05 22:15:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:14,502 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 794 transitions. [2021-06-05 22:15:14,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 794 transitions. [2021-06-05 22:15:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:14,502 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:14,503 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:14,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable501 [2021-06-05 22:15:14,704 INFO L430 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1722290082, now seen corresponding path program 6 times [2021-06-05 22:15:14,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:14,704 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670852863] [2021-06-05 22:15:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:14,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:14,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670852863] [2021-06-05 22:15:14,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670852863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:14,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692438027] [2021-06-05 22:15:14,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:14,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:14,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:14,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:14,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:14,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692438027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:14,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:14,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:14,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256395177] [2021-06-05 22:15:14,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:14,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:14,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:14,804 INFO L87 Difference]: Start difference. First operand 262 states and 794 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:14,883 INFO L93 Difference]: Finished difference Result 354 states and 1042 transitions. [2021-06-05 22:15:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:14,884 INFO L225 Difference]: With dead ends: 354 [2021-06-05 22:15:14,884 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 22:15:14,884 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 22:15:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 262. [2021-06-05 22:15:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0268199233716473) internal successors, (790), 261 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 790 transitions. [2021-06-05 22:15:14,887 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 790 transitions. Word has length 19 [2021-06-05 22:15:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:14,887 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 790 transitions. [2021-06-05 22:15:14,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 790 transitions. [2021-06-05 22:15:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:14,887 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:14,887 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:15,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502,111 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:15,093 INFO L430 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 597015721, now seen corresponding path program 6 times [2021-06-05 22:15:15,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:15,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950534012] [2021-06-05 22:15:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:15,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:15,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950534012] [2021-06-05 22:15:15,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950534012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:15,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338382217] [2021-06-05 22:15:15,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:15,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:15,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:15,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:15,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:15,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338382217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:15,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:15,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:15,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740227546] [2021-06-05 22:15:15,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:15,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:15,208 INFO L87 Difference]: Start difference. First operand 262 states and 790 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:15,304 INFO L93 Difference]: Finished difference Result 326 states and 967 transitions. [2021-06-05 22:15:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:15,305 INFO L225 Difference]: With dead ends: 326 [2021-06-05 22:15:15,305 INFO L226 Difference]: Without dead ends: 326 [2021-06-05 22:15:15,305 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-06-05 22:15:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 246. [2021-06-05 22:15:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.012244897959184) internal successors, (738), 245 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 22:15:15,308 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 22:15:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:15,308 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 22:15:15,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 22:15:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:15,309 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:15,309 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:15,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable505 [2021-06-05 22:15:15,509 INFO L430 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 132155580, now seen corresponding path program 7 times [2021-06-05 22:15:15,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:15,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186664381] [2021-06-05 22:15:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:15,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:15,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186664381] [2021-06-05 22:15:15,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186664381] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:15,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039204784] [2021-06-05 22:15:15,538 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:15,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:15,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:15,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039204784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:15,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:15,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:15,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951656650] [2021-06-05 22:15:15,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:15,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:15,620 INFO L87 Difference]: Start difference. First operand 246 states and 738 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:15,710 INFO L93 Difference]: Finished difference Result 492 states and 1411 transitions. [2021-06-05 22:15:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:15,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:15,711 INFO L225 Difference]: With dead ends: 492 [2021-06-05 22:15:15,711 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 22:15:15,711 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 22:15:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 255. [2021-06-05 22:15:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.0196850393700787) internal successors, (767), 254 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 767 transitions. [2021-06-05 22:15:15,714 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 767 transitions. Word has length 19 [2021-06-05 22:15:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:15,714 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 767 transitions. [2021-06-05 22:15:15,714 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 767 transitions. [2021-06-05 22:15:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:15,715 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:15,715 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:15,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506,113 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:15,915 INFO L430 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash 48107957, now seen corresponding path program 7 times [2021-06-05 22:15:15,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:15,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604248708] [2021-06-05 22:15:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:15,947 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:15,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604248708] [2021-06-05 22:15:15,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604248708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:15,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731450408] [2021-06-05 22:15:15,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:15,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:15,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:16,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731450408] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:16,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:16,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:16,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5477370] [2021-06-05 22:15:16,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:16,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:16,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:16,017 INFO L87 Difference]: Start difference. First operand 255 states and 767 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:16,104 INFO L93 Difference]: Finished difference Result 608 states and 1788 transitions. [2021-06-05 22:15:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:16,105 INFO L225 Difference]: With dead ends: 608 [2021-06-05 22:15:16,105 INFO L226 Difference]: Without dead ends: 608 [2021-06-05 22:15:16,105 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 59.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-06-05 22:15:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 264. [2021-06-05 22:15:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.053231939163498) internal successors, (803), 263 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 803 transitions. [2021-06-05 22:15:16,108 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 803 transitions. Word has length 19 [2021-06-05 22:15:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:16,109 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 803 transitions. [2021-06-05 22:15:16,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 803 transitions. [2021-06-05 22:15:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:16,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:16,109 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:16,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509,114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:16,325 INFO L430 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -296709027, now seen corresponding path program 8 times [2021-06-05 22:15:16,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:16,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640904] [2021-06-05 22:15:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:16,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:16,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056640904] [2021-06-05 22:15:16,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056640904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:16,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791588236] [2021-06-05 22:15:16,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:16,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:16,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:16,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:16,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:16,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791588236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:16,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:16,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:16,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465971002] [2021-06-05 22:15:16,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:16,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:16,436 INFO L87 Difference]: Start difference. First operand 264 states and 803 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:16,522 INFO L93 Difference]: Finished difference Result 554 states and 1618 transitions. [2021-06-05 22:15:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:16,523 INFO L225 Difference]: With dead ends: 554 [2021-06-05 22:15:16,523 INFO L226 Difference]: Without dead ends: 546 [2021-06-05 22:15:16,523 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-06-05 22:15:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 280. [2021-06-05 22:15:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.078853046594982) internal successors, (859), 279 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 859 transitions. [2021-06-05 22:15:16,526 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 859 transitions. Word has length 19 [2021-06-05 22:15:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:16,527 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 859 transitions. [2021-06-05 22:15:16,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 859 transitions. [2021-06-05 22:15:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:16,527 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:16,527 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:16,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:16,728 INFO L430 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash -264762074, now seen corresponding path program 8 times [2021-06-05 22:15:16,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:16,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041776543] [2021-06-05 22:15:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:16,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:16,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041776543] [2021-06-05 22:15:16,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041776543] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:16,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063518183] [2021-06-05 22:15:16,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:16,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:16,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:16,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:16,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:16,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063518183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:16,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:16,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:16,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664517414] [2021-06-05 22:15:16,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:16,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:16,949 INFO L87 Difference]: Start difference. First operand 280 states and 859 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:17,045 INFO L93 Difference]: Finished difference Result 521 states and 1530 transitions. [2021-06-05 22:15:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:17,046 INFO L225 Difference]: With dead ends: 521 [2021-06-05 22:15:17,046 INFO L226 Difference]: Without dead ends: 521 [2021-06-05 22:15:17,046 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-05 22:15:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 280. [2021-06-05 22:15:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.078853046594982) internal successors, (859), 279 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 859 transitions. [2021-06-05 22:15:17,050 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 859 transitions. Word has length 19 [2021-06-05 22:15:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:17,050 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 859 transitions. [2021-06-05 22:15:17,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 859 transitions. [2021-06-05 22:15:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:17,050 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:17,050 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:17,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable513 [2021-06-05 22:15:17,251 INFO L430 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2136730154, now seen corresponding path program 9 times [2021-06-05 22:15:17,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:17,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278409417] [2021-06-05 22:15:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:17,283 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:17,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278409417] [2021-06-05 22:15:17,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278409417] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:17,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675613668] [2021-06-05 22:15:17,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:17,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:17,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:17,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:17,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:17,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675613668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:17,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:17,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:17,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631527597] [2021-06-05 22:15:17,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:17,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:17,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:17,373 INFO L87 Difference]: Start difference. First operand 280 states and 859 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:17,463 INFO L93 Difference]: Finished difference Result 518 states and 1507 transitions. [2021-06-05 22:15:17,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:17,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:17,464 INFO L225 Difference]: With dead ends: 518 [2021-06-05 22:15:17,465 INFO L226 Difference]: Without dead ends: 509 [2021-06-05 22:15:17,465 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.3ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-06-05 22:15:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 280. [2021-06-05 22:15:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.064516129032258) internal successors, (855), 279 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 855 transitions. [2021-06-05 22:15:17,470 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 855 transitions. Word has length 19 [2021-06-05 22:15:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:17,470 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 855 transitions. [2021-06-05 22:15:17,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 855 transitions. [2021-06-05 22:15:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:17,471 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:17,471 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:17,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:17,689 INFO L430 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash 182575649, now seen corresponding path program 9 times [2021-06-05 22:15:17,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:17,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619381388] [2021-06-05 22:15:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:17,719 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:17,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619381388] [2021-06-05 22:15:17,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619381388] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:17,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317656219] [2021-06-05 22:15:17,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:17,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:17,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:17,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:17,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:17,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317656219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:17,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:17,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:17,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098173854] [2021-06-05 22:15:17,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:17,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:17,791 INFO L87 Difference]: Start difference. First operand 280 states and 855 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:17,874 INFO L93 Difference]: Finished difference Result 572 states and 1674 transitions. [2021-06-05 22:15:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:17,875 INFO L225 Difference]: With dead ends: 572 [2021-06-05 22:15:17,875 INFO L226 Difference]: Without dead ends: 572 [2021-06-05 22:15:17,875 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-05 22:15:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 269. [2021-06-05 22:15:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.0671641791044775) internal successors, (822), 268 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 822 transitions. [2021-06-05 22:15:17,887 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 822 transitions. Word has length 19 [2021-06-05 22:15:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:17,888 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 822 transitions. [2021-06-05 22:15:17,888 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 822 transitions. [2021-06-05 22:15:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:17,888 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:17,888 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:18,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517,118 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:18,105 INFO L430 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash -12394796, now seen corresponding path program 10 times [2021-06-05 22:15:18,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:18,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103101557] [2021-06-05 22:15:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:18,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103101557] [2021-06-05 22:15:18,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103101557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:18,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:18,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:18,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487776167] [2021-06-05 22:15:18,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:18,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:18,134 INFO L87 Difference]: Start difference. First operand 269 states and 822 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:18,229 INFO L93 Difference]: Finished difference Result 413 states and 1194 transitions. [2021-06-05 22:15:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:18,230 INFO L225 Difference]: With dead ends: 413 [2021-06-05 22:15:18,230 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 22:15:18,230 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 22:15:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 273. [2021-06-05 22:15:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 3.0441176470588234) internal successors, (828), 272 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 828 transitions. [2021-06-05 22:15:18,234 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 828 transitions. Word has length 19 [2021-06-05 22:15:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:18,234 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 828 transitions. [2021-06-05 22:15:18,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 828 transitions. [2021-06-05 22:15:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:18,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:18,234 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:18,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2021-06-05 22:15:18,235 INFO L430 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1941255398, now seen corresponding path program 11 times [2021-06-05 22:15:18,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:18,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706617275] [2021-06-05 22:15:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:18,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706617275] [2021-06-05 22:15:18,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706617275] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:18,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:18,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:18,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398876320] [2021-06-05 22:15:18,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:18,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:18,263 INFO L87 Difference]: Start difference. First operand 273 states and 828 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:18,361 INFO L93 Difference]: Finished difference Result 397 states and 1148 transitions. [2021-06-05 22:15:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:18,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:18,362 INFO L225 Difference]: With dead ends: 397 [2021-06-05 22:15:18,362 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 22:15:18,362 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 22:15:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 283. [2021-06-05 22:15:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.024822695035461) internal successors, (853), 282 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 853 transitions. [2021-06-05 22:15:18,366 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 853 transitions. Word has length 19 [2021-06-05 22:15:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:18,366 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 853 transitions. [2021-06-05 22:15:18,366 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 853 transitions. [2021-06-05 22:15:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:18,366 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:18,366 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:18,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2021-06-05 22:15:18,366 INFO L430 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash -449594866, now seen corresponding path program 12 times [2021-06-05 22:15:18,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:18,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761508999] [2021-06-05 22:15:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:18,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761508999] [2021-06-05 22:15:18,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761508999] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:18,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:18,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:18,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769623103] [2021-06-05 22:15:18,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:18,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:18,399 INFO L87 Difference]: Start difference. First operand 283 states and 853 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:18,502 INFO L93 Difference]: Finished difference Result 361 states and 1065 transitions. [2021-06-05 22:15:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:18,502 INFO L225 Difference]: With dead ends: 361 [2021-06-05 22:15:18,503 INFO L226 Difference]: Without dead ends: 346 [2021-06-05 22:15:18,503 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-06-05 22:15:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 269. [2021-06-05 22:15:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.0597014925373136) internal successors, (820), 268 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 820 transitions. [2021-06-05 22:15:18,507 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 820 transitions. Word has length 19 [2021-06-05 22:15:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:18,507 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 820 transitions. [2021-06-05 22:15:18,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 820 transitions. [2021-06-05 22:15:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:18,508 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:18,508 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:18,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2021-06-05 22:15:18,508 INFO L430 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash -405487539, now seen corresponding path program 10 times [2021-06-05 22:15:18,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:18,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452031524] [2021-06-05 22:15:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:18,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452031524] [2021-06-05 22:15:18,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452031524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:18,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454002673] [2021-06-05 22:15:18,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:18,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:18,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:18,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:18,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454002673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:18,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:18,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:18,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889307430] [2021-06-05 22:15:18,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:18,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:18,608 INFO L87 Difference]: Start difference. First operand 269 states and 820 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:18,694 INFO L93 Difference]: Finished difference Result 531 states and 1547 transitions. [2021-06-05 22:15:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:18,695 INFO L225 Difference]: With dead ends: 531 [2021-06-05 22:15:18,695 INFO L226 Difference]: Without dead ends: 531 [2021-06-05 22:15:18,696 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-06-05 22:15:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 254. [2021-06-05 22:15:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 3.0118577075098814) internal successors, (762), 253 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 762 transitions. [2021-06-05 22:15:18,699 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 762 transitions. Word has length 19 [2021-06-05 22:15:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:18,699 INFO L482 AbstractCegarLoop]: Abstraction has 254 states and 762 transitions. [2021-06-05 22:15:18,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 762 transitions. [2021-06-05 22:15:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:18,699 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:18,699 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:18,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable521 [2021-06-05 22:15:18,900 INFO L430 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1305660447, now seen corresponding path program 11 times [2021-06-05 22:15:18,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:18,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058364800] [2021-06-05 22:15:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:18,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:18,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058364800] [2021-06-05 22:15:18,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058364800] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:18,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746676132] [2021-06-05 22:15:18,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:18,959 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:18,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:18,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:18,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746676132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:19,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:19,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:19,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342430314] [2021-06-05 22:15:19,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:19,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:19,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:19,005 INFO L87 Difference]: Start difference. First operand 254 states and 762 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:19,083 INFO L93 Difference]: Finished difference Result 470 states and 1356 transitions. [2021-06-05 22:15:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:19,084 INFO L225 Difference]: With dead ends: 470 [2021-06-05 22:15:19,084 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 22:15:19,084 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 22:15:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 266. [2021-06-05 22:15:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.0226415094339623) internal successors, (801), 265 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 801 transitions. [2021-06-05 22:15:19,088 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 801 transitions. Word has length 19 [2021-06-05 22:15:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:19,088 INFO L482 AbstractCegarLoop]: Abstraction has 266 states and 801 transitions. [2021-06-05 22:15:19,088 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 801 transitions. [2021-06-05 22:15:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:19,089 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:19,089 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:19,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:19,289 INFO L430 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1773947229, now seen corresponding path program 12 times [2021-06-05 22:15:19,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:19,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272154806] [2021-06-05 22:15:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:19,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272154806] [2021-06-05 22:15:19,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272154806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:19,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109098911] [2021-06-05 22:15:19,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:19,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:19,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:19,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:19,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109098911] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:19,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:19,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:19,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774019368] [2021-06-05 22:15:19,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:19,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:19,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:19,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:19,396 INFO L87 Difference]: Start difference. First operand 266 states and 801 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:19,479 INFO L93 Difference]: Finished difference Result 448 states and 1309 transitions. [2021-06-05 22:15:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:19,480 INFO L225 Difference]: With dead ends: 448 [2021-06-05 22:15:19,480 INFO L226 Difference]: Without dead ends: 448 [2021-06-05 22:15:19,480 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-06-05 22:15:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 251. [2021-06-05 22:15:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.024) internal successors, (756), 250 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 756 transitions. [2021-06-05 22:15:19,483 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 756 transitions. Word has length 19 [2021-06-05 22:15:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:19,483 INFO L482 AbstractCegarLoop]: Abstraction has 251 states and 756 transitions. [2021-06-05 22:15:19,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 756 transitions. [2021-06-05 22:15:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:19,483 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:19,483 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:19,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:19,684 INFO L430 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -964970507, now seen corresponding path program 13 times [2021-06-05 22:15:19,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:19,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570107820] [2021-06-05 22:15:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:19,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570107820] [2021-06-05 22:15:19,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570107820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:19,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:19,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:19,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185998189] [2021-06-05 22:15:19,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:19,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:19,712 INFO L87 Difference]: Start difference. First operand 251 states and 756 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:19,795 INFO L93 Difference]: Finished difference Result 469 states and 1343 transitions. [2021-06-05 22:15:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:19,796 INFO L225 Difference]: With dead ends: 469 [2021-06-05 22:15:19,796 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 22:15:19,796 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 22:15:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 271. [2021-06-05 22:15:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.0444444444444443) internal successors, (822), 270 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 822 transitions. [2021-06-05 22:15:19,799 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 822 transitions. Word has length 19 [2021-06-05 22:15:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:19,799 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 822 transitions. [2021-06-05 22:15:19,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 822 transitions. [2021-06-05 22:15:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:19,800 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:19,800 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:19,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2021-06-05 22:15:19,800 INFO L430 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash -584232867, now seen corresponding path program 14 times [2021-06-05 22:15:19,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:19,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592871702] [2021-06-05 22:15:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:19,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592871702] [2021-06-05 22:15:19,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592871702] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:19,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:19,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:19,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680463844] [2021-06-05 22:15:19,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:19,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:19,831 INFO L87 Difference]: Start difference. First operand 271 states and 822 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:19,911 INFO L93 Difference]: Finished difference Result 475 states and 1358 transitions. [2021-06-05 22:15:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:19,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:19,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:19,912 INFO L225 Difference]: With dead ends: 475 [2021-06-05 22:15:19,912 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 22:15:19,912 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 22:15:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 275. [2021-06-05 22:15:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.0328467153284673) internal successors, (831), 274 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 831 transitions. [2021-06-05 22:15:19,916 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 831 transitions. Word has length 19 [2021-06-05 22:15:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:19,916 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 831 transitions. [2021-06-05 22:15:19,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 831 transitions. [2021-06-05 22:15:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:19,917 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:19,917 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:19,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2021-06-05 22:15:19,917 INFO L430 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 967392422, now seen corresponding path program 13 times [2021-06-05 22:15:19,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:19,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401022642] [2021-06-05 22:15:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:19,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:19,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401022642] [2021-06-05 22:15:19,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401022642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:19,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140671] [2021-06-05 22:15:19,953 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:19,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:19,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:20,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140671] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:20,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:20,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:20,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894756147] [2021-06-05 22:15:20,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:20,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:20,045 INFO L87 Difference]: Start difference. First operand 275 states and 831 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:20,139 INFO L93 Difference]: Finished difference Result 493 states and 1439 transitions. [2021-06-05 22:15:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:20,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:20,141 INFO L225 Difference]: With dead ends: 493 [2021-06-05 22:15:20,141 INFO L226 Difference]: Without dead ends: 493 [2021-06-05 22:15:20,141 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-06-05 22:15:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 281. [2021-06-05 22:15:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.0642857142857145) internal successors, (858), 280 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 858 transitions. [2021-06-05 22:15:20,144 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 858 transitions. Word has length 19 [2021-06-05 22:15:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:20,144 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 858 transitions. [2021-06-05 22:15:20,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 858 transitions. [2021-06-05 22:15:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:20,145 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:20,145 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:20,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable528 [2021-06-05 22:15:20,345 INFO L430 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1897553598, now seen corresponding path program 14 times [2021-06-05 22:15:20,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:20,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590238816] [2021-06-05 22:15:20,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:20,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:20,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590238816] [2021-06-05 22:15:20,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590238816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:20,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023975160] [2021-06-05 22:15:20,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:20,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:20,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:20,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:20,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:20,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023975160] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:20,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:20,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:20,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956566596] [2021-06-05 22:15:20,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:20,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:20,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:20,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:20,477 INFO L87 Difference]: Start difference. First operand 281 states and 858 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:20,558 INFO L93 Difference]: Finished difference Result 475 states and 1370 transitions. [2021-06-05 22:15:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:20,559 INFO L225 Difference]: With dead ends: 475 [2021-06-05 22:15:20,559 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 22:15:20,559 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 22:15:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 281. [2021-06-05 22:15:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.0607142857142855) internal successors, (857), 280 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 857 transitions. [2021-06-05 22:15:20,562 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 857 transitions. Word has length 19 [2021-06-05 22:15:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:20,562 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 857 transitions. [2021-06-05 22:15:20,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 857 transitions. [2021-06-05 22:15:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:20,563 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:20,563 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:20,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:20,763 INFO L430 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1169104647, now seen corresponding path program 15 times [2021-06-05 22:15:20,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:20,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44089562] [2021-06-05 22:15:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:20,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:20,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44089562] [2021-06-05 22:15:20,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44089562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:20,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152222639] [2021-06-05 22:15:20,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:20,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:20,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:20,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:20,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:20,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152222639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:20,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:20,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:20,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281180971] [2021-06-05 22:15:20,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:20,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:20,873 INFO L87 Difference]: Start difference. First operand 281 states and 857 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:20,956 INFO L93 Difference]: Finished difference Result 494 states and 1409 transitions. [2021-06-05 22:15:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:20,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:20,957 INFO L225 Difference]: With dead ends: 494 [2021-06-05 22:15:20,957 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 22:15:20,957 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 22:15:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 281. [2021-06-05 22:15:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.0714285714285716) internal successors, (860), 280 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 860 transitions. [2021-06-05 22:15:20,961 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 860 transitions. Word has length 19 [2021-06-05 22:15:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:20,961 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 860 transitions. [2021-06-05 22:15:20,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 860 transitions. [2021-06-05 22:15:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:20,961 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:20,962 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:21,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable532 [2021-06-05 22:15:21,162 INFO L430 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1167792078, now seen corresponding path program 15 times [2021-06-05 22:15:21,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:21,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519183375] [2021-06-05 22:15:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:21,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:21,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519183375] [2021-06-05 22:15:21,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519183375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:21,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031217058] [2021-06-05 22:15:21,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:21,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:15:21,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:21,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:21,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:21,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031217058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:21,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:21,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:21,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366363379] [2021-06-05 22:15:21,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:21,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:21,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:21,289 INFO L87 Difference]: Start difference. First operand 281 states and 860 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:21,392 INFO L93 Difference]: Finished difference Result 484 states and 1404 transitions. [2021-06-05 22:15:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:21,393 INFO L225 Difference]: With dead ends: 484 [2021-06-05 22:15:21,393 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 22:15:21,393 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 22:15:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2021-06-05 22:15:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.062730627306273) internal successors, (830), 271 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 830 transitions. [2021-06-05 22:15:21,397 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 830 transitions. Word has length 19 [2021-06-05 22:15:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:21,397 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 830 transitions. [2021-06-05 22:15:21,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 830 transitions. [2021-06-05 22:15:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:21,397 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:21,397 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:21,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable535 [2021-06-05 22:15:21,598 INFO L430 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1086551406, now seen corresponding path program 16 times [2021-06-05 22:15:21,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:21,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729394996] [2021-06-05 22:15:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:21,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:21,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729394996] [2021-06-05 22:15:21,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729394996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:21,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494445314] [2021-06-05 22:15:21,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:21,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:21,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:21,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:21,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:21,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494445314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:21,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:21,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:21,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392550505] [2021-06-05 22:15:21,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:21,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:21,733 INFO L87 Difference]: Start difference. First operand 272 states and 830 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:21,810 INFO L93 Difference]: Finished difference Result 439 states and 1276 transitions. [2021-06-05 22:15:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:21,811 INFO L225 Difference]: With dead ends: 439 [2021-06-05 22:15:21,811 INFO L226 Difference]: Without dead ends: 430 [2021-06-05 22:15:21,811 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.2ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-06-05 22:15:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 272. [2021-06-05 22:15:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.047970479704797) internal successors, (826), 271 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 22:15:21,814 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 22:15:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:21,814 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 22:15:21,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 22:15:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:21,814 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:21,814 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable536 [2021-06-05 22:15:22,015 INFO L430 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -889110087, now seen corresponding path program 16 times [2021-06-05 22:15:22,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071311848] [2021-06-05 22:15:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071311848] [2021-06-05 22:15:22,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071311848] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:22,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489528799] [2021-06-05 22:15:22,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:22,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:22,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:22,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:22,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489528799] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:22,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:22,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:22,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294105979] [2021-06-05 22:15:22,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:22,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:22,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:22,131 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:22,227 INFO L93 Difference]: Finished difference Result 466 states and 1359 transitions. [2021-06-05 22:15:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:22,228 INFO L225 Difference]: With dead ends: 466 [2021-06-05 22:15:22,228 INFO L226 Difference]: Without dead ends: 466 [2021-06-05 22:15:22,228 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 68.3ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-06-05 22:15:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 268. [2021-06-05 22:15:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 3.048689138576779) internal successors, (814), 267 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 814 transitions. [2021-06-05 22:15:22,231 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 814 transitions. Word has length 19 [2021-06-05 22:15:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:22,231 INFO L482 AbstractCegarLoop]: Abstraction has 268 states and 814 transitions. [2021-06-05 22:15:22,231 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 814 transitions. [2021-06-05 22:15:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:22,232 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:22,232 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:22,432 INFO L430 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1710395246, now seen corresponding path program 17 times [2021-06-05 22:15:22,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108974696] [2021-06-05 22:15:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,462 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108974696] [2021-06-05 22:15:22,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108974696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:22,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:22,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:22,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263654457] [2021-06-05 22:15:22,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:22,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:22,462 INFO L87 Difference]: Start difference. First operand 268 states and 814 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:22,565 INFO L93 Difference]: Finished difference Result 410 states and 1187 transitions. [2021-06-05 22:15:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:22,566 INFO L225 Difference]: With dead ends: 410 [2021-06-05 22:15:22,566 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:15:22,566 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:15:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 278. [2021-06-05 22:15:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 3.0288808664259927) internal successors, (839), 277 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 839 transitions. [2021-06-05 22:15:22,569 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 839 transitions. Word has length 19 [2021-06-05 22:15:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:22,569 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 839 transitions. [2021-06-05 22:15:22,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 839 transitions. [2021-06-05 22:15:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:22,570 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:22,570 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2021-06-05 22:15:22,570 INFO L430 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash 608481094, now seen corresponding path program 18 times [2021-06-05 22:15:22,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625026165] [2021-06-05 22:15:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625026165] [2021-06-05 22:15:22,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625026165] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:22,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:22,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:22,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776597007] [2021-06-05 22:15:22,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:22,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:22,600 INFO L87 Difference]: Start difference. First operand 278 states and 839 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:22,702 INFO L93 Difference]: Finished difference Result 374 states and 1104 transitions. [2021-06-05 22:15:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:22,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:22,702 INFO L225 Difference]: With dead ends: 374 [2021-06-05 22:15:22,703 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 22:15:22,703 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 22:15:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 268. [2021-06-05 22:15:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 3.044943820224719) internal successors, (813), 267 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 813 transitions. [2021-06-05 22:15:22,706 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 813 transitions. Word has length 19 [2021-06-05 22:15:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:22,706 INFO L482 AbstractCegarLoop]: Abstraction has 268 states and 813 transitions. [2021-06-05 22:15:22,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 813 transitions. [2021-06-05 22:15:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:22,706 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:22,706 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2021-06-05 22:15:22,706 INFO L430 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1860559839, now seen corresponding path program 17 times [2021-06-05 22:15:22,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,707 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054692980] [2021-06-05 22:15:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054692980] [2021-06-05 22:15:22,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054692980] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:22,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:22,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:22,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845754607] [2021-06-05 22:15:22,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:22,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:22,735 INFO L87 Difference]: Start difference. First operand 268 states and 813 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:22,826 INFO L93 Difference]: Finished difference Result 435 states and 1255 transitions. [2021-06-05 22:15:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:22,827 INFO L225 Difference]: With dead ends: 435 [2021-06-05 22:15:22,827 INFO L226 Difference]: Without dead ends: 429 [2021-06-05 22:15:22,827 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 57.7ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-06-05 22:15:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 274. [2021-06-05 22:15:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.029304029304029) internal successors, (827), 273 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 827 transitions. [2021-06-05 22:15:22,830 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 827 transitions. Word has length 19 [2021-06-05 22:15:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:22,830 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 827 transitions. [2021-06-05 22:15:22,830 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 827 transitions. [2021-06-05 22:15:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:22,830 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:22,830 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2021-06-05 22:15:22,831 INFO L430 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1590050147, now seen corresponding path program 18 times [2021-06-05 22:15:22,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7900658] [2021-06-05 22:15:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,862 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7900658] [2021-06-05 22:15:22,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7900658] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:22,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:22,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:22,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130352326] [2021-06-05 22:15:22,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:22,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:22,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:22,863 INFO L87 Difference]: Start difference. First operand 274 states and 827 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:22,950 INFO L93 Difference]: Finished difference Result 413 states and 1218 transitions. [2021-06-05 22:15:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:22,951 INFO L225 Difference]: With dead ends: 413 [2021-06-05 22:15:22,951 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 22:15:22,951 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 22:15:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 253. [2021-06-05 22:15:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 3.0277777777777777) internal successors, (763), 252 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 763 transitions. [2021-06-05 22:15:22,954 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 763 transitions. Word has length 19 [2021-06-05 22:15:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:22,954 INFO L482 AbstractCegarLoop]: Abstraction has 253 states and 763 transitions. [2021-06-05 22:15:22,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 763 transitions. [2021-06-05 22:15:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:22,954 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:22,954 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:22,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2021-06-05 22:15:22,955 INFO L430 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash 53973003, now seen corresponding path program 19 times [2021-06-05 22:15:22,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:22,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085896136] [2021-06-05 22:15:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:22,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:22,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085896136] [2021-06-05 22:15:22,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085896136] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:22,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:22,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:22,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952641103] [2021-06-05 22:15:22,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:22,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:22,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:22,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:22,981 INFO L87 Difference]: Start difference. First operand 253 states and 763 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:23,079 INFO L93 Difference]: Finished difference Result 398 states and 1147 transitions. [2021-06-05 22:15:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:23,080 INFO L225 Difference]: With dead ends: 398 [2021-06-05 22:15:23,080 INFO L226 Difference]: Without dead ends: 382 [2021-06-05 22:15:23,080 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-06-05 22:15:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 259. [2021-06-05 22:15:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 3.0232558139534884) internal successors, (780), 258 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 780 transitions. [2021-06-05 22:15:23,083 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 780 transitions. Word has length 19 [2021-06-05 22:15:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:23,083 INFO L482 AbstractCegarLoop]: Abstraction has 259 states and 780 transitions. [2021-06-05 22:15:23,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 780 transitions. [2021-06-05 22:15:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:23,083 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:23,083 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:23,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2021-06-05 22:15:23,083 INFO L430 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -481846493, now seen corresponding path program 20 times [2021-06-05 22:15:23,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:23,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026296917] [2021-06-05 22:15:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:23,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026296917] [2021-06-05 22:15:23,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026296917] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:23,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:23,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:23,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092289787] [2021-06-05 22:15:23,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:23,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:23,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:23,112 INFO L87 Difference]: Start difference. First operand 259 states and 780 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:23,225 INFO L93 Difference]: Finished difference Result 427 states and 1201 transitions. [2021-06-05 22:15:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:23,226 INFO L225 Difference]: With dead ends: 427 [2021-06-05 22:15:23,226 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 22:15:23,226 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 22:15:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 275. [2021-06-05 22:15:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.0072992700729926) internal successors, (824), 274 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 824 transitions. [2021-06-05 22:15:23,229 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 824 transitions. Word has length 19 [2021-06-05 22:15:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:23,230 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 824 transitions. [2021-06-05 22:15:23,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 824 transitions. [2021-06-05 22:15:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:23,230 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:23,230 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:23,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2021-06-05 22:15:23,230 INFO L430 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash -101108853, now seen corresponding path program 21 times [2021-06-05 22:15:23,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:23,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281374034] [2021-06-05 22:15:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:23,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281374034] [2021-06-05 22:15:23,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281374034] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:23,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:23,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:23,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306819675] [2021-06-05 22:15:23,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:23,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:23,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:23,259 INFO L87 Difference]: Start difference. First operand 275 states and 824 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:23,357 INFO L93 Difference]: Finished difference Result 390 states and 1115 transitions. [2021-06-05 22:15:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:23,358 INFO L225 Difference]: With dead ends: 390 [2021-06-05 22:15:23,358 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 22:15:23,358 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 22:15:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 265. [2021-06-05 22:15:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.015151515151515) internal successors, (796), 264 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 796 transitions. [2021-06-05 22:15:23,361 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 796 transitions. Word has length 19 [2021-06-05 22:15:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:23,361 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 796 transitions. [2021-06-05 22:15:23,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 796 transitions. [2021-06-05 22:15:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:23,362 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:23,362 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:23,362 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2021-06-05 22:15:23,362 INFO L430 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1901365676, now seen corresponding path program 19 times [2021-06-05 22:15:23,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:23,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715580955] [2021-06-05 22:15:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,389 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:23,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715580955] [2021-06-05 22:15:23,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715580955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:23,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327195143] [2021-06-05 22:15:23,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:23,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:23,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327195143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:23,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:23,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:23,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123723405] [2021-06-05 22:15:23,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:23,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:23,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:23,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:23,457 INFO L87 Difference]: Start difference. First operand 265 states and 796 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:23,535 INFO L93 Difference]: Finished difference Result 537 states and 1572 transitions. [2021-06-05 22:15:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:23,536 INFO L225 Difference]: With dead ends: 537 [2021-06-05 22:15:23,536 INFO L226 Difference]: Without dead ends: 537 [2021-06-05 22:15:23,536 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-06-05 22:15:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 271. [2021-06-05 22:15:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.025925925925926) internal successors, (817), 270 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 817 transitions. [2021-06-05 22:15:23,539 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 817 transitions. Word has length 19 [2021-06-05 22:15:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:23,539 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 817 transitions. [2021-06-05 22:15:23,539 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 817 transitions. [2021-06-05 22:15:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:23,540 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:23,540 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:23,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable547 [2021-06-05 22:15:23,748 INFO L430 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2057197508, now seen corresponding path program 20 times [2021-06-05 22:15:23,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:23,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720097766] [2021-06-05 22:15:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:23,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720097766] [2021-06-05 22:15:23,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720097766] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:23,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098549802] [2021-06-05 22:15:23,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:23,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:23,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:23,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:23,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:23,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098549802] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:23,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:23,857 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:23,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823188128] [2021-06-05 22:15:23,857 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:23,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:23,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:23,858 INFO L87 Difference]: Start difference. First operand 271 states and 817 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:23,945 INFO L93 Difference]: Finished difference Result 552 states and 1596 transitions. [2021-06-05 22:15:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:23,946 INFO L225 Difference]: With dead ends: 552 [2021-06-05 22:15:23,946 INFO L226 Difference]: Without dead ends: 552 [2021-06-05 22:15:23,946 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-06-05 22:15:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 277. [2021-06-05 22:15:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.0579710144927534) internal successors, (844), 276 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 844 transitions. [2021-06-05 22:15:23,951 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 844 transitions. Word has length 19 [2021-06-05 22:15:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:23,951 INFO L482 AbstractCegarLoop]: Abstraction has 277 states and 844 transitions. [2021-06-05 22:15:23,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 844 transitions. [2021-06-05 22:15:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:23,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:23,952 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:24,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548,129 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:24,161 INFO L430 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1127036332, now seen corresponding path program 21 times [2021-06-05 22:15:24,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:24,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189907952] [2021-06-05 22:15:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:24,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:24,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189907952] [2021-06-05 22:15:24,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189907952] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:24,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196343858] [2021-06-05 22:15:24,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:24,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:24,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:24,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:24,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:24,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196343858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:24,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:24,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:24,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79085512] [2021-06-05 22:15:24,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:24,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:24,266 INFO L87 Difference]: Start difference. First operand 277 states and 844 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:24,346 INFO L93 Difference]: Finished difference Result 498 states and 1443 transitions. [2021-06-05 22:15:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:24,347 INFO L225 Difference]: With dead ends: 498 [2021-06-05 22:15:24,347 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 22:15:24,347 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.3ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 22:15:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 274. [2021-06-05 22:15:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.0549450549450547) internal successors, (834), 273 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 834 transitions. [2021-06-05 22:15:24,351 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 834 transitions. Word has length 19 [2021-06-05 22:15:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:24,351 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 834 transitions. [2021-06-05 22:15:24,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 834 transitions. [2021-06-05 22:15:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:24,351 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:24,351 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:24,551 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:24,552 INFO L430 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1979218041, now seen corresponding path program 22 times [2021-06-05 22:15:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:24,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636485954] [2021-06-05 22:15:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:24,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:24,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636485954] [2021-06-05 22:15:24,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636485954] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:24,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730927089] [2021-06-05 22:15:24,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:24,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:24,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:24,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:24,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:24,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730927089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:24,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:24,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:24,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063815837] [2021-06-05 22:15:24,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:24,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:24,667 INFO L87 Difference]: Start difference. First operand 274 states and 834 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:24,752 INFO L93 Difference]: Finished difference Result 476 states and 1382 transitions. [2021-06-05 22:15:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:24,753 INFO L225 Difference]: With dead ends: 476 [2021-06-05 22:15:24,753 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 22:15:24,753 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 22:15:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 271. [2021-06-05 22:15:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.051851851851852) internal successors, (824), 270 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 824 transitions. [2021-06-05 22:15:24,756 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 824 transitions. Word has length 19 [2021-06-05 22:15:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:24,757 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 824 transitions. [2021-06-05 22:15:24,757 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 824 transitions. [2021-06-05 22:15:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:24,757 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:24,757 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:24,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:24,962 INFO L430 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 16056364, now seen corresponding path program 22 times [2021-06-05 22:15:24,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:24,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555763349] [2021-06-05 22:15:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:24,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:24,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555763349] [2021-06-05 22:15:24,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555763349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:24,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672310660] [2021-06-05 22:15:24,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:25,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:25,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:25,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:25,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:25,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672310660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:25,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:25,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:25,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537219323] [2021-06-05 22:15:25,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:25,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:25,074 INFO L87 Difference]: Start difference. First operand 271 states and 824 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:25,165 INFO L93 Difference]: Finished difference Result 539 states and 1596 transitions. [2021-06-05 22:15:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:25,166 INFO L225 Difference]: With dead ends: 539 [2021-06-05 22:15:25,166 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 22:15:25,167 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 57.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 22:15:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 259. [2021-06-05 22:15:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 3.0310077519379846) internal successors, (782), 258 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 782 transitions. [2021-06-05 22:15:25,171 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 782 transitions. Word has length 19 [2021-06-05 22:15:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:25,172 INFO L482 AbstractCegarLoop]: Abstraction has 259 states and 782 transitions. [2021-06-05 22:15:25,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 782 transitions. [2021-06-05 22:15:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:25,172 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:25,172 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:25,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555,132 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:25,389 INFO L430 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash -366317049, now seen corresponding path program 23 times [2021-06-05 22:15:25,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:25,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104888127] [2021-06-05 22:15:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:25,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:25,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104888127] [2021-06-05 22:15:25,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104888127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:25,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491497409] [2021-06-05 22:15:25,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:25,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:25,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:25,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:25,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:25,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491497409] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:25,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:25,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:25,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677747685] [2021-06-05 22:15:25,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:25,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:25,511 INFO L87 Difference]: Start difference. First operand 259 states and 782 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:25,600 INFO L93 Difference]: Finished difference Result 482 states and 1413 transitions. [2021-06-05 22:15:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:25,601 INFO L225 Difference]: With dead ends: 482 [2021-06-05 22:15:25,602 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 22:15:25,602 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.7ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 22:15:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 275. [2021-06-05 22:15:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.0583941605839415) internal successors, (838), 274 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 838 transitions. [2021-06-05 22:15:25,605 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 838 transitions. Word has length 19 [2021-06-05 22:15:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:25,605 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 838 transitions. [2021-06-05 22:15:25,605 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 838 transitions. [2021-06-05 22:15:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:25,606 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:25,606 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:25,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable556 [2021-06-05 22:15:25,806 INFO L430 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash -334370096, now seen corresponding path program 23 times [2021-06-05 22:15:25,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:25,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411391324] [2021-06-05 22:15:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:25,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:25,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411391324] [2021-06-05 22:15:25,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411391324] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:25,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688940414] [2021-06-05 22:15:25,836 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:25,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:25,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:25,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:25,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:25,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688940414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:25,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:25,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:25,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239374543] [2021-06-05 22:15:25,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:25,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:25,909 INFO L87 Difference]: Start difference. First operand 275 states and 838 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:25,993 INFO L93 Difference]: Finished difference Result 532 states and 1566 transitions. [2021-06-05 22:15:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:25,994 INFO L225 Difference]: With dead ends: 532 [2021-06-05 22:15:25,994 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 22:15:25,995 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 22:15:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 275. [2021-06-05 22:15:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.0583941605839415) internal successors, (838), 274 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 838 transitions. [2021-06-05 22:15:25,998 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 838 transitions. Word has length 19 [2021-06-05 22:15:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:25,998 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 838 transitions. [2021-06-05 22:15:25,998 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 838 transitions. [2021-06-05 22:15:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:25,999 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:25,999 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:26,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:26,199 INFO L430 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2088629120, now seen corresponding path program 24 times [2021-06-05 22:15:26,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:26,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994626084] [2021-06-05 22:15:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:26,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:26,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994626084] [2021-06-05 22:15:26,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994626084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:26,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406617678] [2021-06-05 22:15:26,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:26,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:26,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:26,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:26,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:26,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406617678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:26,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:26,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:26,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584356985] [2021-06-05 22:15:26,307 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:26,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:26,307 INFO L87 Difference]: Start difference. First operand 275 states and 838 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:26,390 INFO L93 Difference]: Finished difference Result 478 states and 1416 transitions. [2021-06-05 22:15:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:26,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:26,391 INFO L225 Difference]: With dead ends: 478 [2021-06-05 22:15:26,391 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 22:15:26,391 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 22:15:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 275. [2021-06-05 22:15:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.0437956204379564) internal successors, (834), 274 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 834 transitions. [2021-06-05 22:15:26,395 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 834 transitions. Word has length 19 [2021-06-05 22:15:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:26,395 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 834 transitions. [2021-06-05 22:15:26,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 834 transitions. [2021-06-05 22:15:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:26,395 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:26,395 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:26,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:26,596 INFO L430 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash 112967627, now seen corresponding path program 24 times [2021-06-05 22:15:26,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:26,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767789233] [2021-06-05 22:15:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:26,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:26,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767789233] [2021-06-05 22:15:26,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767789233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:26,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834172310] [2021-06-05 22:15:26,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:26,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:26,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:26,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:26,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:26,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834172310] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:26,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:26,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:26,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384042827] [2021-06-05 22:15:26,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:26,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:26,725 INFO L87 Difference]: Start difference. First operand 275 states and 834 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:26,819 INFO L93 Difference]: Finished difference Result 445 states and 1322 transitions. [2021-06-05 22:15:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:26,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:26,820 INFO L225 Difference]: With dead ends: 445 [2021-06-05 22:15:26,820 INFO L226 Difference]: Without dead ends: 445 [2021-06-05 22:15:26,820 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-06-05 22:15:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 255. [2021-06-05 22:15:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.031496062992126) internal successors, (770), 254 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 770 transitions. [2021-06-05 22:15:26,823 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 770 transitions. Word has length 19 [2021-06-05 22:15:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:26,823 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 770 transitions. [2021-06-05 22:15:26,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 770 transitions. [2021-06-05 22:15:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:26,824 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:26,824 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:27,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable563 [2021-06-05 22:15:27,024 INFO L430 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 510647071, now seen corresponding path program 25 times [2021-06-05 22:15:27,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:27,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051759729] [2021-06-05 22:15:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:27,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051759729] [2021-06-05 22:15:27,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051759729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:27,057 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:27,057 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:27,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854530131] [2021-06-05 22:15:27,057 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:27,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:27,057 INFO L87 Difference]: Start difference. First operand 255 states and 770 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:27,171 INFO L93 Difference]: Finished difference Result 454 states and 1310 transitions. [2021-06-05 22:15:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:27,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:27,172 INFO L225 Difference]: With dead ends: 454 [2021-06-05 22:15:27,172 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 22:15:27,172 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 22:15:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 275. [2021-06-05 22:15:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.051094890510949) internal successors, (836), 274 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 836 transitions. [2021-06-05 22:15:27,176 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 836 transitions. Word has length 19 [2021-06-05 22:15:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:27,176 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 836 transitions. [2021-06-05 22:15:27,176 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 836 transitions. [2021-06-05 22:15:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:27,176 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:27,176 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:27,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2021-06-05 22:15:27,176 INFO L430 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash 891384711, now seen corresponding path program 26 times [2021-06-05 22:15:27,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:27,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839115538] [2021-06-05 22:15:27,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:27,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839115538] [2021-06-05 22:15:27,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839115538] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:27,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:27,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:27,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275567584] [2021-06-05 22:15:27,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:27,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:27,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:27,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:27,209 INFO L87 Difference]: Start difference. First operand 275 states and 836 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:27,309 INFO L93 Difference]: Finished difference Result 460 states and 1325 transitions. [2021-06-05 22:15:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:27,310 INFO L225 Difference]: With dead ends: 460 [2021-06-05 22:15:27,310 INFO L226 Difference]: Without dead ends: 452 [2021-06-05 22:15:27,310 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-06-05 22:15:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 279. [2021-06-05 22:15:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.039568345323741) internal successors, (845), 278 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 845 transitions. [2021-06-05 22:15:27,313 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 845 transitions. Word has length 19 [2021-06-05 22:15:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:27,313 INFO L482 AbstractCegarLoop]: Abstraction has 279 states and 845 transitions. [2021-06-05 22:15:27,313 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 845 transitions. [2021-06-05 22:15:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:27,314 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:27,314 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:27,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2021-06-05 22:15:27,314 INFO L430 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1851957296, now seen corresponding path program 25 times [2021-06-05 22:15:27,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:27,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990643225] [2021-06-05 22:15:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:27,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990643225] [2021-06-05 22:15:27,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990643225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:27,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281502351] [2021-06-05 22:15:27,346 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:27,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:27,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281502351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:27,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:27,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:27,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620340790] [2021-06-05 22:15:27,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:27,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:27,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:27,432 INFO L87 Difference]: Start difference. First operand 279 states and 845 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:27,532 INFO L93 Difference]: Finished difference Result 519 states and 1519 transitions. [2021-06-05 22:15:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:27,533 INFO L225 Difference]: With dead ends: 519 [2021-06-05 22:15:27,533 INFO L226 Difference]: Without dead ends: 519 [2021-06-05 22:15:27,533 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-06-05 22:15:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 285. [2021-06-05 22:15:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.0704225352112675) internal successors, (872), 284 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 22:15:27,536 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 19 [2021-06-05 22:15:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:27,536 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 22:15:27,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 22:15:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:27,537 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:27,537 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:27,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:27,737 INFO L430 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -921796120, now seen corresponding path program 26 times [2021-06-05 22:15:27,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:27,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379239701] [2021-06-05 22:15:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:27,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379239701] [2021-06-05 22:15:27,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379239701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:27,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278828791] [2021-06-05 22:15:27,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:27,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:27,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:27,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:27,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:27,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278828791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:27,851 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:27,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:27,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28904149] [2021-06-05 22:15:27,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:27,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:27,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:27,851 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:27,933 INFO L93 Difference]: Finished difference Result 501 states and 1450 transitions. [2021-06-05 22:15:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:27,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:27,934 INFO L225 Difference]: With dead ends: 501 [2021-06-05 22:15:27,934 INFO L226 Difference]: Without dead ends: 495 [2021-06-05 22:15:27,934 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-06-05 22:15:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 284. [2021-06-05 22:15:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.0636042402826855) internal successors, (867), 283 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 867 transitions. [2021-06-05 22:15:27,938 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 867 transitions. Word has length 19 [2021-06-05 22:15:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:27,938 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 867 transitions. [2021-06-05 22:15:27,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 867 transitions. [2021-06-05 22:15:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:27,938 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:27,938 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:28,139 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable567 [2021-06-05 22:15:28,139 INFO L430 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 306512931, now seen corresponding path program 27 times [2021-06-05 22:15:28,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:28,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038054271] [2021-06-05 22:15:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:28,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:28,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038054271] [2021-06-05 22:15:28,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038054271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:28,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368472963] [2021-06-05 22:15:28,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:28,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:28,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:28,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:28,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:28,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368472963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:28,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:28,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:28,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516721255] [2021-06-05 22:15:28,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:28,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:28,291 INFO L87 Difference]: Start difference. First operand 284 states and 867 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:28,380 INFO L93 Difference]: Finished difference Result 478 states and 1372 transitions. [2021-06-05 22:15:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:28,381 INFO L225 Difference]: With dead ends: 478 [2021-06-05 22:15:28,381 INFO L226 Difference]: Without dead ends: 470 [2021-06-05 22:15:28,381 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-06-05 22:15:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 284. [2021-06-05 22:15:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.0742049469964665) internal successors, (870), 283 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 870 transitions. [2021-06-05 22:15:28,384 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 870 transitions. Word has length 19 [2021-06-05 22:15:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:28,384 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 870 transitions. [2021-06-05 22:15:28,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 870 transitions. [2021-06-05 22:15:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:28,388 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:28,388 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:28,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570,139 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:28,589 INFO L430 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1651557640, now seen corresponding path program 27 times [2021-06-05 22:15:28,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:28,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355600180] [2021-06-05 22:15:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:28,621 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:28,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355600180] [2021-06-05 22:15:28,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355600180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:28,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825243976] [2021-06-05 22:15:28,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:28,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:15:28,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:28,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:28,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:28,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825243976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:28,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:28,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:28,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838895178] [2021-06-05 22:15:28,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:28,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:28,702 INFO L87 Difference]: Start difference. First operand 284 states and 870 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:28,782 INFO L93 Difference]: Finished difference Result 498 states and 1443 transitions. [2021-06-05 22:15:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:28,783 INFO L225 Difference]: With dead ends: 498 [2021-06-05 22:15:28,783 INFO L226 Difference]: Without dead ends: 498 [2021-06-05 22:15:28,783 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-06-05 22:15:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 275. [2021-06-05 22:15:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.065693430656934) internal successors, (840), 274 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 840 transitions. [2021-06-05 22:15:28,787 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 840 transitions. Word has length 19 [2021-06-05 22:15:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:28,787 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 840 transitions. [2021-06-05 22:15:28,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 840 transitions. [2021-06-05 22:15:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:28,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:28,787 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:28,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable573 [2021-06-05 22:15:28,988 INFO L430 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1732798312, now seen corresponding path program 28 times [2021-06-05 22:15:28,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:28,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632318793] [2021-06-05 22:15:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:29,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:29,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632318793] [2021-06-05 22:15:29,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632318793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:29,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147016965] [2021-06-05 22:15:29,016 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:29,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:29,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:29,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:29,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:29,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147016965] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:29,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:29,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:29,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945312609] [2021-06-05 22:15:29,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:29,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:29,095 INFO L87 Difference]: Start difference. First operand 275 states and 840 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:29,196 INFO L93 Difference]: Finished difference Result 453 states and 1315 transitions. [2021-06-05 22:15:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:29,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:29,197 INFO L225 Difference]: With dead ends: 453 [2021-06-05 22:15:29,197 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 22:15:29,197 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 62.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 22:15:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 275. [2021-06-05 22:15:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.051094890510949) internal successors, (836), 274 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 836 transitions. [2021-06-05 22:15:29,200 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 836 transitions. Word has length 19 [2021-06-05 22:15:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:29,200 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 836 transitions. [2021-06-05 22:15:29,200 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 836 transitions. [2021-06-05 22:15:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:29,200 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:29,200 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:29,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:29,401 INFO L430 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 586507491, now seen corresponding path program 28 times [2021-06-05 22:15:29,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:29,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386940937] [2021-06-05 22:15:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:29,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:29,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386940937] [2021-06-05 22:15:29,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386940937] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:29,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072200896] [2021-06-05 22:15:29,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:29,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:29,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:29,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:29,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:29,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072200896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:29,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:29,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:29,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643994113] [2021-06-05 22:15:29,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:29,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:29,552 INFO L87 Difference]: Start difference. First operand 275 states and 836 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:29,659 INFO L93 Difference]: Finished difference Result 450 states and 1322 transitions. [2021-06-05 22:15:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:29,659 INFO L225 Difference]: With dead ends: 450 [2021-06-05 22:15:29,659 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 22:15:29,660 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 22:15:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 271. [2021-06-05 22:15:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.051851851851852) internal successors, (824), 270 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 824 transitions. [2021-06-05 22:15:29,663 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 824 transitions. Word has length 19 [2021-06-05 22:15:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:29,663 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 824 transitions. [2021-06-05 22:15:29,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 824 transitions. [2021-06-05 22:15:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:29,663 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:29,663 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:29,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable577 [2021-06-05 22:15:29,864 INFO L430 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1108954472, now seen corresponding path program 29 times [2021-06-05 22:15:29,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:29,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584175526] [2021-06-05 22:15:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:29,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:29,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584175526] [2021-06-05 22:15:29,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584175526] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:29,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:29,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:29,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618782164] [2021-06-05 22:15:29,893 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:29,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:29,894 INFO L87 Difference]: Start difference. First operand 271 states and 824 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:29,973 INFO L93 Difference]: Finished difference Result 424 states and 1226 transitions. [2021-06-05 22:15:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:29,974 INFO L225 Difference]: With dead ends: 424 [2021-06-05 22:15:29,974 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 22:15:29,974 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 22:15:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 281. [2021-06-05 22:15:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.032142857142857) internal successors, (849), 280 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 849 transitions. [2021-06-05 22:15:29,977 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 849 transitions. Word has length 19 [2021-06-05 22:15:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:29,977 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 849 transitions. [2021-06-05 22:15:29,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 849 transitions. [2021-06-05 22:15:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:29,978 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:29,978 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:29,978 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2021-06-05 22:15:29,978 INFO L430 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2084098672, now seen corresponding path program 30 times [2021-06-05 22:15:29,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:29,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669118011] [2021-06-05 22:15:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:30,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669118011] [2021-06-05 22:15:30,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669118011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:30,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:30,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:30,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169858348] [2021-06-05 22:15:30,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:30,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:30,006 INFO L87 Difference]: Start difference. First operand 281 states and 849 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:30,083 INFO L93 Difference]: Finished difference Result 388 states and 1143 transitions. [2021-06-05 22:15:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:30,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:30,084 INFO L225 Difference]: With dead ends: 388 [2021-06-05 22:15:30,084 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 22:15:30,084 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 22:15:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 271. [2021-06-05 22:15:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.0481481481481483) internal successors, (823), 270 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 823 transitions. [2021-06-05 22:15:30,087 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 823 transitions. Word has length 19 [2021-06-05 22:15:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:30,087 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 823 transitions. [2021-06-05 22:15:30,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 823 transitions. [2021-06-05 22:15:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:30,088 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:30,088 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:30,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2021-06-05 22:15:30,088 INFO L430 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash -384942261, now seen corresponding path program 29 times [2021-06-05 22:15:30,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:30,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135544140] [2021-06-05 22:15:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:30,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135544140] [2021-06-05 22:15:30,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135544140] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:30,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:30,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:30,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852673771] [2021-06-05 22:15:30,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:30,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:30,119 INFO L87 Difference]: Start difference. First operand 271 states and 823 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:30,222 INFO L93 Difference]: Finished difference Result 401 states and 1166 transitions. [2021-06-05 22:15:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:30,223 INFO L225 Difference]: With dead ends: 401 [2021-06-05 22:15:30,223 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 22:15:30,223 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 22:15:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 277. [2021-06-05 22:15:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.032608695652174) internal successors, (837), 276 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 837 transitions. [2021-06-05 22:15:30,226 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 837 transitions. Word has length 19 [2021-06-05 22:15:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:30,226 INFO L482 AbstractCegarLoop]: Abstraction has 277 states and 837 transitions. [2021-06-05 22:15:30,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 837 transitions. [2021-06-05 22:15:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:30,227 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:30,227 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:30,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2021-06-05 22:15:30,227 INFO L430 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -114432569, now seen corresponding path program 30 times [2021-06-05 22:15:30,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:30,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774009498] [2021-06-05 22:15:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:30,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774009498] [2021-06-05 22:15:30,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774009498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:30,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:30,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:30,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567066903] [2021-06-05 22:15:30,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:30,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:30,272 INFO L87 Difference]: Start difference. First operand 277 states and 837 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:30,383 INFO L93 Difference]: Finished difference Result 379 states and 1129 transitions. [2021-06-05 22:15:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:30,384 INFO L225 Difference]: With dead ends: 379 [2021-06-05 22:15:30,384 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 22:15:30,384 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 22:15:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 255. [2021-06-05 22:15:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.031496062992126) internal successors, (770), 254 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 770 transitions. [2021-06-05 22:15:30,387 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 770 transitions. Word has length 19 [2021-06-05 22:15:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:30,387 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 770 transitions. [2021-06-05 22:15:30,387 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 770 transitions. [2021-06-05 22:15:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:30,387 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:30,387 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:30,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2021-06-05 22:15:30,388 INFO L430 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 401252280, now seen corresponding path program 31 times [2021-06-05 22:15:30,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:30,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690334494] [2021-06-05 22:15:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:30,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690334494] [2021-06-05 22:15:30,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690334494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:30,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204328426] [2021-06-05 22:15:30,415 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:30,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204328426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:30,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:30,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:30,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904148537] [2021-06-05 22:15:30,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:30,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:30,492 INFO L87 Difference]: Start difference. First operand 255 states and 770 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:30,570 INFO L93 Difference]: Finished difference Result 485 states and 1377 transitions. [2021-06-05 22:15:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:30,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:30,571 INFO L225 Difference]: With dead ends: 485 [2021-06-05 22:15:30,571 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 22:15:30,571 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 66.1ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 22:15:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 255. [2021-06-05 22:15:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.0039370078740157) internal successors, (763), 254 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 763 transitions. [2021-06-05 22:15:30,574 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 763 transitions. Word has length 19 [2021-06-05 22:15:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:30,574 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 763 transitions. [2021-06-05 22:15:30,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 763 transitions. [2021-06-05 22:15:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:30,575 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:30,575 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:30,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582,143 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:30,775 INFO L430 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 317204657, now seen corresponding path program 31 times [2021-06-05 22:15:30,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:30,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584303214] [2021-06-05 22:15:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:30,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584303214] [2021-06-05 22:15:30,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584303214] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:30,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681908894] [2021-06-05 22:15:30,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:30,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:30,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:30,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681908894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:30,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:30,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:30,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772995208] [2021-06-05 22:15:30,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:30,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:30,868 INFO L87 Difference]: Start difference. First operand 255 states and 763 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:30,955 INFO L93 Difference]: Finished difference Result 428 states and 1251 transitions. [2021-06-05 22:15:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:30,956 INFO L225 Difference]: With dead ends: 428 [2021-06-05 22:15:30,956 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 22:15:30,956 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 22:15:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 255. [2021-06-05 22:15:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 3.0039370078740157) internal successors, (763), 254 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 763 transitions. [2021-06-05 22:15:30,959 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 763 transitions. Word has length 19 [2021-06-05 22:15:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:30,959 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 763 transitions. [2021-06-05 22:15:30,959 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 763 transitions. [2021-06-05 22:15:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:30,959 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:30,959 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:31,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable585 [2021-06-05 22:15:31,173 INFO L430 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -27612327, now seen corresponding path program 32 times [2021-06-05 22:15:31,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:31,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110044950] [2021-06-05 22:15:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:31,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:31,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110044950] [2021-06-05 22:15:31,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110044950] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:31,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249006828] [2021-06-05 22:15:31,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:31,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:31,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:31,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:31,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:31,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249006828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:31,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:31,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:31,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857405962] [2021-06-05 22:15:31,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:31,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:31,272 INFO L87 Difference]: Start difference. First operand 255 states and 763 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:31,349 INFO L93 Difference]: Finished difference Result 425 states and 1238 transitions. [2021-06-05 22:15:31,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:31,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:31,350 INFO L225 Difference]: With dead ends: 425 [2021-06-05 22:15:31,350 INFO L226 Difference]: Without dead ends: 417 [2021-06-05 22:15:31,350 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-06-05 22:15:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 271. [2021-06-05 22:15:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.033333333333333) internal successors, (819), 270 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 819 transitions. [2021-06-05 22:15:31,353 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 819 transitions. Word has length 19 [2021-06-05 22:15:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:31,353 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 819 transitions. [2021-06-05 22:15:31,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 819 transitions. [2021-06-05 22:15:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:31,353 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:31,353 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:31,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable586 [2021-06-05 22:15:31,554 INFO L430 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash 4334626, now seen corresponding path program 32 times [2021-06-05 22:15:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:31,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936989441] [2021-06-05 22:15:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:31,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:31,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936989441] [2021-06-05 22:15:31,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936989441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:31,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198494438] [2021-06-05 22:15:31,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:31,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:31,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:31,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:31,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:31,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198494438] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:31,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:31,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:31,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905322517] [2021-06-05 22:15:31,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:31,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:31,678 INFO L87 Difference]: Start difference. First operand 271 states and 819 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:31,775 INFO L93 Difference]: Finished difference Result 489 states and 1412 transitions. [2021-06-05 22:15:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:31,776 INFO L225 Difference]: With dead ends: 489 [2021-06-05 22:15:31,776 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 22:15:31,776 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 22:15:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 271. [2021-06-05 22:15:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.033333333333333) internal successors, (819), 270 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 819 transitions. [2021-06-05 22:15:31,780 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 819 transitions. Word has length 19 [2021-06-05 22:15:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:31,780 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 819 transitions. [2021-06-05 22:15:31,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 819 transitions. [2021-06-05 22:15:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:31,780 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:31,780 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:31,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:31,981 INFO L430 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1867633454, now seen corresponding path program 33 times [2021-06-05 22:15:31,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:31,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021094541] [2021-06-05 22:15:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:32,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021094541] [2021-06-05 22:15:32,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021094541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:32,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418196245] [2021-06-05 22:15:32,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:32,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:32,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:32,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:32,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418196245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:32,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:32,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:32,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973491656] [2021-06-05 22:15:32,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:32,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:32,104 INFO L87 Difference]: Start difference. First operand 271 states and 819 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:32,199 INFO L93 Difference]: Finished difference Result 498 states and 1425 transitions. [2021-06-05 22:15:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:32,200 INFO L225 Difference]: With dead ends: 498 [2021-06-05 22:15:32,200 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 22:15:32,200 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 22:15:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 271. [2021-06-05 22:15:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.0185185185185186) internal successors, (815), 270 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 815 transitions. [2021-06-05 22:15:32,204 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 815 transitions. Word has length 19 [2021-06-05 22:15:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:32,204 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 815 transitions. [2021-06-05 22:15:32,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 815 transitions. [2021-06-05 22:15:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:32,204 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:32,204 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:32,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable590 [2021-06-05 22:15:32,405 INFO L430 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 451672349, now seen corresponding path program 33 times [2021-06-05 22:15:32,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:32,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507656729] [2021-06-05 22:15:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:32,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507656729] [2021-06-05 22:15:32,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507656729] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:32,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939345896] [2021-06-05 22:15:32,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:32,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:32,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:32,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:32,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939345896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:32,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:32,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:32,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924358372] [2021-06-05 22:15:32,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:32,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:32,505 INFO L87 Difference]: Start difference. First operand 271 states and 815 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:32,587 INFO L93 Difference]: Finished difference Result 447 states and 1310 transitions. [2021-06-05 22:15:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:32,588 INFO L225 Difference]: With dead ends: 447 [2021-06-05 22:15:32,588 INFO L226 Difference]: Without dead ends: 447 [2021-06-05 22:15:32,588 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-06-05 22:15:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 260. [2021-06-05 22:15:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.0193050193050195) internal successors, (782), 259 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 782 transitions. [2021-06-05 22:15:32,591 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 782 transitions. Word has length 19 [2021-06-05 22:15:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:32,591 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 782 transitions. [2021-06-05 22:15:32,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 782 transitions. [2021-06-05 22:15:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:32,592 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:32,592 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:32,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:32,792 INFO L430 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 256701904, now seen corresponding path program 34 times [2021-06-05 22:15:32,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:32,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112419220] [2021-06-05 22:15:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:32,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112419220] [2021-06-05 22:15:32,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112419220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:32,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:32,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:32,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006193041] [2021-06-05 22:15:32,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:32,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:32,818 INFO L87 Difference]: Start difference. First operand 260 states and 782 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:32,888 INFO L93 Difference]: Finished difference Result 556 states and 1559 transitions. [2021-06-05 22:15:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:32,889 INFO L225 Difference]: With dead ends: 556 [2021-06-05 22:15:32,889 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 22:15:32,889 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 22:15:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 264. [2021-06-05 22:15:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.9961977186311786) internal successors, (788), 263 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 788 transitions. [2021-06-05 22:15:32,892 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 788 transitions. Word has length 19 [2021-06-05 22:15:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:32,893 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 788 transitions. [2021-06-05 22:15:32,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 788 transitions. [2021-06-05 22:15:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:32,893 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:32,893 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:32,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2021-06-05 22:15:32,893 INFO L430 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2084615198, now seen corresponding path program 35 times [2021-06-05 22:15:32,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:32,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892133184] [2021-06-05 22:15:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:32,921 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:32,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892133184] [2021-06-05 22:15:32,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892133184] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:32,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:32,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:32,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123889501] [2021-06-05 22:15:32,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:32,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:32,922 INFO L87 Difference]: Start difference. First operand 264 states and 788 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:32,995 INFO L93 Difference]: Finished difference Result 540 states and 1513 transitions. [2021-06-05 22:15:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:32,996 INFO L225 Difference]: With dead ends: 540 [2021-06-05 22:15:32,996 INFO L226 Difference]: Without dead ends: 534 [2021-06-05 22:15:32,996 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-06-05 22:15:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 274. [2021-06-05 22:15:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.978021978021978) internal successors, (813), 273 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 813 transitions. [2021-06-05 22:15:32,999 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 813 transitions. Word has length 19 [2021-06-05 22:15:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:32,999 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 813 transitions. [2021-06-05 22:15:33,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 813 transitions. [2021-06-05 22:15:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:33,000 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:33,000 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:33,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2021-06-05 22:15:33,000 INFO L430 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash -180498166, now seen corresponding path program 36 times [2021-06-05 22:15:33,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:33,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551634384] [2021-06-05 22:15:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:33,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551634384] [2021-06-05 22:15:33,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551634384] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:33,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:33,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:33,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474487407] [2021-06-05 22:15:33,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:33,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:33,029 INFO L87 Difference]: Start difference. First operand 274 states and 813 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:33,105 INFO L93 Difference]: Finished difference Result 504 states and 1430 transitions. [2021-06-05 22:15:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:33,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:33,106 INFO L225 Difference]: With dead ends: 504 [2021-06-05 22:15:33,106 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 22:15:33,106 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 22:15:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 260. [2021-06-05 22:15:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.011583011583012) internal successors, (780), 259 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 780 transitions. [2021-06-05 22:15:33,110 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 780 transitions. Word has length 19 [2021-06-05 22:15:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:33,110 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 780 transitions. [2021-06-05 22:15:33,110 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 780 transitions. [2021-06-05 22:15:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:33,110 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:33,110 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:33,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2021-06-05 22:15:33,110 INFO L430 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash -136390839, now seen corresponding path program 34 times [2021-06-05 22:15:33,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:33,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580321883] [2021-06-05 22:15:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:33,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580321883] [2021-06-05 22:15:33,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580321883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:33,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335132406] [2021-06-05 22:15:33,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:33,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:33,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:33,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:33,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335132406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:33,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:33,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:33,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067536393] [2021-06-05 22:15:33,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:33,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:33,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:33,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:33,235 INFO L87 Difference]: Start difference. First operand 260 states and 780 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:33,324 INFO L93 Difference]: Finished difference Result 588 states and 1723 transitions. [2021-06-05 22:15:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:33,325 INFO L225 Difference]: With dead ends: 588 [2021-06-05 22:15:33,325 INFO L226 Difference]: Without dead ends: 588 [2021-06-05 22:15:33,325 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.7ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-06-05 22:15:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 266. [2021-06-05 22:15:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.0113207547169814) internal successors, (798), 265 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 798 transitions. [2021-06-05 22:15:33,328 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 798 transitions. Word has length 19 [2021-06-05 22:15:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:33,328 INFO L482 AbstractCegarLoop]: Abstraction has 266 states and 798 transitions. [2021-06-05 22:15:33,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 798 transitions. [2021-06-05 22:15:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:33,333 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:33,333 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:33,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable597 [2021-06-05 22:15:33,544 INFO L430 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1036563747, now seen corresponding path program 35 times [2021-06-05 22:15:33,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:33,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009663632] [2021-06-05 22:15:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:33,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009663632] [2021-06-05 22:15:33,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009663632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:33,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153945056] [2021-06-05 22:15:33,571 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:33,598 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:33,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:33,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:33,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153945056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:33,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:33,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:33,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627155183] [2021-06-05 22:15:33,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:33,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:33,642 INFO L87 Difference]: Start difference. First operand 266 states and 798 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:33,724 INFO L93 Difference]: Finished difference Result 527 states and 1532 transitions. [2021-06-05 22:15:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:33,725 INFO L225 Difference]: With dead ends: 527 [2021-06-05 22:15:33,725 INFO L226 Difference]: Without dead ends: 521 [2021-06-05 22:15:33,725 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.4ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-05 22:15:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 278. [2021-06-05 22:15:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 3.0216606498194944) internal successors, (837), 277 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 837 transitions. [2021-06-05 22:15:33,729 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 837 transitions. Word has length 19 [2021-06-05 22:15:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:33,729 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 837 transitions. [2021-06-05 22:15:33,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 837 transitions. [2021-06-05 22:15:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:33,730 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:33,730 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:33,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable598 [2021-06-05 22:15:33,944 INFO L430 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2043043929, now seen corresponding path program 36 times [2021-06-05 22:15:33,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:33,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722685822] [2021-06-05 22:15:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:33,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:33,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722685822] [2021-06-05 22:15:33,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722685822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:33,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936570740] [2021-06-05 22:15:33,989 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:34,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:34,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:34,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:34,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:34,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936570740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:34,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:34,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:34,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736952920] [2021-06-05 22:15:34,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:34,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:34,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:34,060 INFO L87 Difference]: Start difference. First operand 278 states and 837 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:34,152 INFO L93 Difference]: Finished difference Result 505 states and 1485 transitions. [2021-06-05 22:15:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:34,153 INFO L225 Difference]: With dead ends: 505 [2021-06-05 22:15:34,153 INFO L226 Difference]: Without dead ends: 505 [2021-06-05 22:15:34,153 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.4ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-06-05 22:15:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 260. [2021-06-05 22:15:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.011583011583012) internal successors, (780), 259 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 780 transitions. [2021-06-05 22:15:34,157 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 780 transitions. Word has length 19 [2021-06-05 22:15:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:34,157 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 780 transitions. [2021-06-05 22:15:34,157 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 780 transitions. [2021-06-05 22:15:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:34,157 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:34,157 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:34,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable601 [2021-06-05 22:15:34,358 INFO L430 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash -695873807, now seen corresponding path program 37 times [2021-06-05 22:15:34,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:34,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288636883] [2021-06-05 22:15:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:34,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:34,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288636883] [2021-06-05 22:15:34,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288636883] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:34,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:34,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:34,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354507222] [2021-06-05 22:15:34,386 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:34,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:34,386 INFO L87 Difference]: Start difference. First operand 260 states and 780 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:34,460 INFO L93 Difference]: Finished difference Result 507 states and 1464 transitions. [2021-06-05 22:15:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:34,461 INFO L225 Difference]: With dead ends: 507 [2021-06-05 22:15:34,461 INFO L226 Difference]: Without dead ends: 499 [2021-06-05 22:15:34,461 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-06-05 22:15:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 272. [2021-06-05 22:15:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.047970479704797) internal successors, (826), 271 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 22:15:34,465 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 22:15:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:34,465 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 22:15:34,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 22:15:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:34,465 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:34,466 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:34,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2021-06-05 22:15:34,466 INFO L430 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash -315136167, now seen corresponding path program 38 times [2021-06-05 22:15:34,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:34,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794270563] [2021-06-05 22:15:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:34,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:34,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794270563] [2021-06-05 22:15:34,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794270563] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:34,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:34,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:34,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824767146] [2021-06-05 22:15:34,507 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:34,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:34,508 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:34,599 INFO L93 Difference]: Finished difference Result 497 states and 1439 transitions. [2021-06-05 22:15:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:34,600 INFO L225 Difference]: With dead ends: 497 [2021-06-05 22:15:34,600 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 22:15:34,600 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 22:15:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 276. [2021-06-05 22:15:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.036363636363636) internal successors, (835), 275 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 835 transitions. [2021-06-05 22:15:34,604 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 835 transitions. Word has length 19 [2021-06-05 22:15:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:34,604 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 835 transitions. [2021-06-05 22:15:34,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 835 transitions. [2021-06-05 22:15:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:34,604 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:34,604 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:34,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2021-06-05 22:15:34,604 INFO L430 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1236489122, now seen corresponding path program 37 times [2021-06-05 22:15:34,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:34,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718004040] [2021-06-05 22:15:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:34,639 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:34,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718004040] [2021-06-05 22:15:34,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718004040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:34,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973379936] [2021-06-05 22:15:34,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:34,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:34,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:34,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973379936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:34,730 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:34,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:34,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95597994] [2021-06-05 22:15:34,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:34,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:34,731 INFO L87 Difference]: Start difference. First operand 276 states and 835 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:34,817 INFO L93 Difference]: Finished difference Result 591 states and 1709 transitions. [2021-06-05 22:15:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:34,818 INFO L225 Difference]: With dead ends: 591 [2021-06-05 22:15:34,818 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 22:15:34,818 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 22:15:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 282. [2021-06-05 22:15:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 3.0676156583629894) internal successors, (862), 281 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 862 transitions. [2021-06-05 22:15:34,822 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 862 transitions. Word has length 19 [2021-06-05 22:15:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:34,822 INFO L482 AbstractCegarLoop]: Abstraction has 282 states and 862 transitions. [2021-06-05 22:15:34,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 862 transitions. [2021-06-05 22:15:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:34,822 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:34,822 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:35,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable604 [2021-06-05 22:15:35,024 INFO L430 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2128316998, now seen corresponding path program 38 times [2021-06-05 22:15:35,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:35,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558309065] [2021-06-05 22:15:35,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:35,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:35,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558309065] [2021-06-05 22:15:35,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558309065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:35,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436117] [2021-06-05 22:15:35,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:35,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:35,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:35,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:35,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:35,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436117] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:35,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:35,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:35,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948337554] [2021-06-05 22:15:35,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:35,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:35,223 INFO L87 Difference]: Start difference. First operand 282 states and 862 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:35,309 INFO L93 Difference]: Finished difference Result 573 states and 1640 transitions. [2021-06-05 22:15:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:35,310 INFO L225 Difference]: With dead ends: 573 [2021-06-05 22:15:35,310 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 22:15:35,310 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 22:15:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 281. [2021-06-05 22:15:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.0607142857142855) internal successors, (857), 280 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 857 transitions. [2021-06-05 22:15:35,314 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 857 transitions. Word has length 19 [2021-06-05 22:15:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:35,314 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 857 transitions. [2021-06-05 22:15:35,314 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 857 transitions. [2021-06-05 22:15:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:35,315 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:35,315 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:35,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:35,515 INFO L430 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash -900007947, now seen corresponding path program 39 times [2021-06-05 22:15:35,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:35,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447838400] [2021-06-05 22:15:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:35,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:35,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447838400] [2021-06-05 22:15:35,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447838400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:35,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238385240] [2021-06-05 22:15:35,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:35,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:35,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:35,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:35,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:35,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238385240] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:35,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:35,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:35,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519308088] [2021-06-05 22:15:35,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:35,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:35,628 INFO L87 Difference]: Start difference. First operand 281 states and 857 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:35,703 INFO L93 Difference]: Finished difference Result 558 states and 1599 transitions. [2021-06-05 22:15:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:35,704 INFO L225 Difference]: With dead ends: 558 [2021-06-05 22:15:35,704 INFO L226 Difference]: Without dead ends: 550 [2021-06-05 22:15:35,704 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-06-05 22:15:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 281. [2021-06-05 22:15:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.0714285714285716) internal successors, (860), 280 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 860 transitions. [2021-06-05 22:15:35,708 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 860 transitions. Word has length 19 [2021-06-05 22:15:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:35,708 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 860 transitions. [2021-06-05 22:15:35,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 860 transitions. [2021-06-05 22:15:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:35,709 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:35,709 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:35,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608,154 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:35,909 INFO L430 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1436888778, now seen corresponding path program 39 times [2021-06-05 22:15:35,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:35,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232986852] [2021-06-05 22:15:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:35,943 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:35,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232986852] [2021-06-05 22:15:35,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232986852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:35,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125921565] [2021-06-05 22:15:35,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:35,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:15:35,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:35,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:36,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125921565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:36,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:36,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:36,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507088184] [2021-06-05 22:15:36,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:36,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:36,034 INFO L87 Difference]: Start difference. First operand 281 states and 860 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:36,127 INFO L93 Difference]: Finished difference Result 621 states and 1765 transitions. [2021-06-05 22:15:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:36,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:36,128 INFO L225 Difference]: With dead ends: 621 [2021-06-05 22:15:36,128 INFO L226 Difference]: Without dead ends: 621 [2021-06-05 22:15:36,128 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 80.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-05 22:15:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 272. [2021-06-05 22:15:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.062730627306273) internal successors, (830), 271 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 830 transitions. [2021-06-05 22:15:36,132 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 830 transitions. Word has length 19 [2021-06-05 22:15:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:36,132 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 830 transitions. [2021-06-05 22:15:36,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 830 transitions. [2021-06-05 22:15:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:36,133 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:36,133 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:36,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 155 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable611 [2021-06-05 22:15:36,333 INFO L430 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1355648106, now seen corresponding path program 40 times [2021-06-05 22:15:36,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:36,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537052856] [2021-06-05 22:15:36,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:36,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:36,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537052856] [2021-06-05 22:15:36,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537052856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:36,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879369258] [2021-06-05 22:15:36,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:36,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:36,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:36,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:36,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:36,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879369258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:36,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:36,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:36,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270853311] [2021-06-05 22:15:36,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:36,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:36,482 INFO L87 Difference]: Start difference. First operand 272 states and 830 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:36,574 INFO L93 Difference]: Finished difference Result 576 states and 1637 transitions. [2021-06-05 22:15:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:36,575 INFO L225 Difference]: With dead ends: 576 [2021-06-05 22:15:36,575 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 22:15:36,575 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 22:15:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 272. [2021-06-05 22:15:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.047970479704797) internal successors, (826), 271 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 22:15:36,581 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 22:15:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:36,581 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 22:15:36,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 22:15:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:36,581 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:36,581 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:36,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:36,794 INFO L430 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash -620013387, now seen corresponding path program 40 times [2021-06-05 22:15:36,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:36,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014271953] [2021-06-05 22:15:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:36,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:36,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014271953] [2021-06-05 22:15:36,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014271953] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:36,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536931492] [2021-06-05 22:15:36,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:36,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:36,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:36,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:36,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:36,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536931492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:36,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:36,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:36,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987262222] [2021-06-05 22:15:36,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:36,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:36,922 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,030 INFO L93 Difference]: Finished difference Result 530 states and 1549 transitions. [2021-06-05 22:15:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,031 INFO L225 Difference]: With dead ends: 530 [2021-06-05 22:15:37,031 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 22:15:37,031 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 70.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 22:15:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 264. [2021-06-05 22:15:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.0190114068441063) internal successors, (794), 263 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 794 transitions. [2021-06-05 22:15:37,035 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 794 transitions. Word has length 19 [2021-06-05 22:15:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,035 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 794 transitions. [2021-06-05 22:15:37,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 794 transitions. [2021-06-05 22:15:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,035 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,035 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615,157 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:37,236 INFO L430 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1979491946, now seen corresponding path program 41 times [2021-06-05 22:15:37,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917390587] [2021-06-05 22:15:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917390587] [2021-06-05 22:15:37,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917390587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653565572] [2021-06-05 22:15:37,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,267 INFO L87 Difference]: Start difference. First operand 264 states and 794 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,338 INFO L93 Difference]: Finished difference Result 551 states and 1548 transitions. [2021-06-05 22:15:37,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,339 INFO L225 Difference]: With dead ends: 551 [2021-06-05 22:15:37,339 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 22:15:37,339 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 22:15:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 274. [2021-06-05 22:15:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.0) internal successors, (819), 273 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 819 transitions. [2021-06-05 22:15:37,343 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 819 transitions. Word has length 19 [2021-06-05 22:15:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,343 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 819 transitions. [2021-06-05 22:15:37,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 819 transitions. [2021-06-05 22:15:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,344 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,344 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2021-06-05 22:15:37,344 INFO L430 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 877577794, now seen corresponding path program 42 times [2021-06-05 22:15:37,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23620837] [2021-06-05 22:15:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23620837] [2021-06-05 22:15:37,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23620837] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861798278] [2021-06-05 22:15:37,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,374 INFO L87 Difference]: Start difference. First operand 274 states and 819 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,442 INFO L93 Difference]: Finished difference Result 515 states and 1465 transitions. [2021-06-05 22:15:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,443 INFO L225 Difference]: With dead ends: 515 [2021-06-05 22:15:37,443 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 22:15:37,443 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 22:15:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 264. [2021-06-05 22:15:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.0152091254752853) internal successors, (793), 263 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 793 transitions. [2021-06-05 22:15:37,446 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 793 transitions. Word has length 19 [2021-06-05 22:15:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,447 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 793 transitions. [2021-06-05 22:15:37,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 793 transitions. [2021-06-05 22:15:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,447 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,447 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2021-06-05 22:15:37,447 INFO L430 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1591463139, now seen corresponding path program 41 times [2021-06-05 22:15:37,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297068537] [2021-06-05 22:15:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297068537] [2021-06-05 22:15:37,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297068537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450987645] [2021-06-05 22:15:37,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,476 INFO L87 Difference]: Start difference. First operand 264 states and 793 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,563 INFO L93 Difference]: Finished difference Result 504 states and 1450 transitions. [2021-06-05 22:15:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,563 INFO L225 Difference]: With dead ends: 504 [2021-06-05 22:15:37,564 INFO L226 Difference]: Without dead ends: 498 [2021-06-05 22:15:37,564 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 48.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-06-05 22:15:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 276. [2021-06-05 22:15:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.018181818181818) internal successors, (830), 275 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 830 transitions. [2021-06-05 22:15:37,567 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 830 transitions. Word has length 19 [2021-06-05 22:15:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,567 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 830 transitions. [2021-06-05 22:15:37,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 830 transitions. [2021-06-05 22:15:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,568 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,568 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2021-06-05 22:15:37,568 INFO L430 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1320953447, now seen corresponding path program 42 times [2021-06-05 22:15:37,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493680993] [2021-06-05 22:15:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493680993] [2021-06-05 22:15:37,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493680993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838138581] [2021-06-05 22:15:37,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,599 INFO L87 Difference]: Start difference. First operand 276 states and 830 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,688 INFO L93 Difference]: Finished difference Result 482 states and 1413 transitions. [2021-06-05 22:15:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,689 INFO L225 Difference]: With dead ends: 482 [2021-06-05 22:15:37,689 INFO L226 Difference]: Without dead ends: 482 [2021-06-05 22:15:37,689 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-06-05 22:15:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 261. [2021-06-05 22:15:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 3.0153846153846153) internal successors, (784), 260 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 784 transitions. [2021-06-05 22:15:37,692 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 784 transitions. Word has length 19 [2021-06-05 22:15:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,692 INFO L482 AbstractCegarLoop]: Abstraction has 261 states and 784 transitions. [2021-06-05 22:15:37,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 784 transitions. [2021-06-05 22:15:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,693 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,693 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2021-06-05 22:15:37,693 INFO L430 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash -549537380, now seen corresponding path program 43 times [2021-06-05 22:15:37,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586736727] [2021-06-05 22:15:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586736727] [2021-06-05 22:15:37,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586736727] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051445967] [2021-06-05 22:15:37,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,719 INFO L87 Difference]: Start difference. First operand 261 states and 784 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,783 INFO L93 Difference]: Finished difference Result 407 states and 1153 transitions. [2021-06-05 22:15:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,784 INFO L225 Difference]: With dead ends: 407 [2021-06-05 22:15:37,784 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 22:15:37,784 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 22:15:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 265. [2021-06-05 22:15:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.992424242424242) internal successors, (790), 264 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 790 transitions. [2021-06-05 22:15:37,787 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 790 transitions. Word has length 19 [2021-06-05 22:15:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,787 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 790 transitions. [2021-06-05 22:15:37,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 790 transitions. [2021-06-05 22:15:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,787 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2021-06-05 22:15:37,787 INFO L430 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1404112814, now seen corresponding path program 44 times [2021-06-05 22:15:37,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394484485] [2021-06-05 22:15:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394484485] [2021-06-05 22:15:37,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394484485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175939106] [2021-06-05 22:15:37,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,816 INFO L87 Difference]: Start difference. First operand 265 states and 790 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:37,897 INFO L93 Difference]: Finished difference Result 430 states and 1198 transitions. [2021-06-05 22:15:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:37,898 INFO L225 Difference]: With dead ends: 430 [2021-06-05 22:15:37,898 INFO L226 Difference]: Without dead ends: 424 [2021-06-05 22:15:37,898 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-06-05 22:15:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 275. [2021-06-05 22:15:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.9744525547445257) internal successors, (815), 274 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 815 transitions. [2021-06-05 22:15:37,901 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 815 transitions. Word has length 19 [2021-06-05 22:15:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:37,901 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 815 transitions. [2021-06-05 22:15:37,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 815 transitions. [2021-06-05 22:15:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:37,902 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:37,902 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:37,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2021-06-05 22:15:37,902 INFO L430 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash -986737450, now seen corresponding path program 45 times [2021-06-05 22:15:37,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:37,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381328281] [2021-06-05 22:15:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:37,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:37,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381328281] [2021-06-05 22:15:37,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381328281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:37,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:37,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:37,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950577270] [2021-06-05 22:15:37,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:37,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:37,932 INFO L87 Difference]: Start difference. First operand 275 states and 815 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,018 INFO L93 Difference]: Finished difference Result 394 states and 1115 transitions. [2021-06-05 22:15:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,019 INFO L225 Difference]: With dead ends: 394 [2021-06-05 22:15:38,019 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 22:15:38,019 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 22:15:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 261. [2021-06-05 22:15:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 3.0) internal successors, (780), 260 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 780 transitions. [2021-06-05 22:15:38,022 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 780 transitions. Word has length 19 [2021-06-05 22:15:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,022 INFO L482 AbstractCegarLoop]: Abstraction has 261 states and 780 transitions. [2021-06-05 22:15:38,022 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 780 transitions. [2021-06-05 22:15:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,023 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,023 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:38,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2021-06-05 22:15:38,023 INFO L430 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 879484852, now seen corresponding path program 46 times [2021-06-05 22:15:38,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:38,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123000532] [2021-06-05 22:15:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:38,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123000532] [2021-06-05 22:15:38,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123000532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:38,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:38,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:38,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349573765] [2021-06-05 22:15:38,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:38,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:38,059 INFO L87 Difference]: Start difference. First operand 261 states and 780 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,120 INFO L93 Difference]: Finished difference Result 393 states and 1118 transitions. [2021-06-05 22:15:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,120 INFO L225 Difference]: With dead ends: 393 [2021-06-05 22:15:38,121 INFO L226 Difference]: Without dead ends: 381 [2021-06-05 22:15:38,121 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-06-05 22:15:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 263. [2021-06-05 22:15:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.9885496183206106) internal successors, (783), 262 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 783 transitions. [2021-06-05 22:15:38,125 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 783 transitions. Word has length 19 [2021-06-05 22:15:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,125 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 783 transitions. [2021-06-05 22:15:38,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 783 transitions. [2021-06-05 22:15:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,126 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:38,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2021-06-05 22:15:38,126 INFO L430 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash 199463632, now seen corresponding path program 47 times [2021-06-05 22:15:38,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:38,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164436770] [2021-06-05 22:15:38,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:38,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164436770] [2021-06-05 22:15:38,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164436770] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:38,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:38,155 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:38,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206298247] [2021-06-05 22:15:38,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:38,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:38,155 INFO L87 Difference]: Start difference. First operand 263 states and 783 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,240 INFO L93 Difference]: Finished difference Result 381 states and 1080 transitions. [2021-06-05 22:15:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,241 INFO L225 Difference]: With dead ends: 381 [2021-06-05 22:15:38,241 INFO L226 Difference]: Without dead ends: 375 [2021-06-05 22:15:38,241 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-06-05 22:15:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 273. [2021-06-05 22:15:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.9705882352941178) internal successors, (808), 272 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 808 transitions. [2021-06-05 22:15:38,244 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 808 transitions. Word has length 19 [2021-06-05 22:15:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,244 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 808 transitions. [2021-06-05 22:15:38,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 808 transitions. [2021-06-05 22:15:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,245 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,245 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:38,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2021-06-05 22:15:38,245 INFO L430 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2103580664, now seen corresponding path program 48 times [2021-06-05 22:15:38,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:38,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110241642] [2021-06-05 22:15:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,275 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:38,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110241642] [2021-06-05 22:15:38,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110241642] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:38,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:38,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:38,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754791982] [2021-06-05 22:15:38,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:38,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:38,276 INFO L87 Difference]: Start difference. First operand 273 states and 808 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,348 INFO L93 Difference]: Finished difference Result 345 states and 997 transitions. [2021-06-05 22:15:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,349 INFO L225 Difference]: With dead ends: 345 [2021-06-05 22:15:38,349 INFO L226 Difference]: Without dead ends: 328 [2021-06-05 22:15:38,349 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-06-05 22:15:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 257. [2021-06-05 22:15:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 3.015625) internal successors, (772), 256 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 772 transitions. [2021-06-05 22:15:38,352 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 772 transitions. Word has length 19 [2021-06-05 22:15:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,352 INFO L482 AbstractCegarLoop]: Abstraction has 257 states and 772 transitions. [2021-06-05 22:15:38,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 772 transitions. [2021-06-05 22:15:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,353 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,353 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:38,353 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2021-06-05 22:15:38,353 INFO L430 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1070480311, now seen corresponding path program 43 times [2021-06-05 22:15:38,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:38,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339215846] [2021-06-05 22:15:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:38,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339215846] [2021-06-05 22:15:38,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339215846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:38,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651640091] [2021-06-05 22:15:38,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:38,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651640091] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:38,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:38,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:38,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528927823] [2021-06-05 22:15:38,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:38,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:38,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:38,447 INFO L87 Difference]: Start difference. First operand 257 states and 772 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,535 INFO L93 Difference]: Finished difference Result 449 states and 1320 transitions. [2021-06-05 22:15:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,536 INFO L225 Difference]: With dead ends: 449 [2021-06-05 22:15:38,536 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 22:15:38,536 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 22:15:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 235. [2021-06-05 22:15:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.0213675213675213) internal successors, (707), 234 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 707 transitions. [2021-06-05 22:15:38,539 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 707 transitions. Word has length 19 [2021-06-05 22:15:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,539 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 707 transitions. [2021-06-05 22:15:38,539 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 707 transitions. [2021-06-05 22:15:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,539 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,539 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:38,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626,158 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:38,740 INFO L430 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash 170307403, now seen corresponding path program 44 times [2021-06-05 22:15:38,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:38,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432146880] [2021-06-05 22:15:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:38,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432146880] [2021-06-05 22:15:38,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432146880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:38,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610322480] [2021-06-05 22:15:38,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:38,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:38,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:38,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:38,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:38,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610322480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:38,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:38,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:38,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929290315] [2021-06-05 22:15:38,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:38,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:38,838 INFO L87 Difference]: Start difference. First operand 235 states and 707 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:38,926 INFO L93 Difference]: Finished difference Result 437 states and 1251 transitions. [2021-06-05 22:15:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:38,927 INFO L225 Difference]: With dead ends: 437 [2021-06-05 22:15:38,927 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 22:15:38,927 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 22:15:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 241. [2021-06-05 22:15:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 3.004166666666667) internal successors, (721), 240 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 721 transitions. [2021-06-05 22:15:38,930 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 721 transitions. Word has length 19 [2021-06-05 22:15:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:38,931 INFO L482 AbstractCegarLoop]: Abstraction has 241 states and 721 transitions. [2021-06-05 22:15:38,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 721 transitions. [2021-06-05 22:15:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:38,931 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:38,931 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:39,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable627 [2021-06-05 22:15:39,132 INFO L430 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1045052217, now seen corresponding path program 45 times [2021-06-05 22:15:39,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:39,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17559251] [2021-06-05 22:15:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:39,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:39,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17559251] [2021-06-05 22:15:39,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17559251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:39,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336179493] [2021-06-05 22:15:39,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:39,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:39,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:39,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:39,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336179493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:39,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:39,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:39,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926307443] [2021-06-05 22:15:39,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:39,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:39,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:39,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:39,231 INFO L87 Difference]: Start difference. First operand 241 states and 721 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:39,332 INFO L93 Difference]: Finished difference Result 415 states and 1214 transitions. [2021-06-05 22:15:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:39,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:39,333 INFO L225 Difference]: With dead ends: 415 [2021-06-05 22:15:39,333 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 22:15:39,333 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 22:15:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 214. [2021-06-05 22:15:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.0) internal successors, (639), 213 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 639 transitions. [2021-06-05 22:15:39,335 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 639 transitions. Word has length 19 [2021-06-05 22:15:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:39,336 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 639 transitions. [2021-06-05 22:15:39,336 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 639 transitions. [2021-06-05 22:15:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:39,336 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:39,336 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:39,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 160 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable630 [2021-06-05 22:15:39,536 INFO L430 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -990658535, now seen corresponding path program 46 times [2021-06-05 22:15:39,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:39,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047404266] [2021-06-05 22:15:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:39,566 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:39,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047404266] [2021-06-05 22:15:39,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047404266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:39,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315195248] [2021-06-05 22:15:39,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:39,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:39,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:39,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:39,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:39,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315195248] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:39,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:39,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:39,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777778715] [2021-06-05 22:15:39,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:39,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:39,643 INFO L87 Difference]: Start difference. First operand 214 states and 639 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:39,729 INFO L93 Difference]: Finished difference Result 367 states and 1064 transitions. [2021-06-05 22:15:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:39,730 INFO L225 Difference]: With dead ends: 367 [2021-06-05 22:15:39,730 INFO L226 Difference]: Without dead ends: 355 [2021-06-05 22:15:39,730 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-06-05 22:15:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2021-06-05 22:15:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 3.0) internal successors, (648), 216 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 648 transitions. [2021-06-05 22:15:39,733 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 648 transitions. Word has length 19 [2021-06-05 22:15:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:39,733 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 648 transitions. [2021-06-05 22:15:39,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 648 transitions. [2021-06-05 22:15:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:39,733 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:39,733 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:39,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable631 [2021-06-05 22:15:39,934 INFO L430 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -33107299, now seen corresponding path program 47 times [2021-06-05 22:15:39,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:39,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406425570] [2021-06-05 22:15:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:39,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:39,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406425570] [2021-06-05 22:15:39,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406425570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:39,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271127499] [2021-06-05 22:15:39,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:39,991 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:39,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:39,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:39,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:40,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271127499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:40,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:40,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:40,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785097914] [2021-06-05 22:15:40,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:40,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:40,045 INFO L87 Difference]: Start difference. First operand 217 states and 648 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:40,131 INFO L93 Difference]: Finished difference Result 355 states and 1025 transitions. [2021-06-05 22:15:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:40,132 INFO L225 Difference]: With dead ends: 355 [2021-06-05 22:15:40,132 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 22:15:40,132 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 22:15:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 229. [2021-06-05 22:15:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 3.013157894736842) internal successors, (687), 228 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 687 transitions. [2021-06-05 22:15:40,135 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 687 transitions. Word has length 19 [2021-06-05 22:15:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:40,135 INFO L482 AbstractCegarLoop]: Abstraction has 229 states and 687 transitions. [2021-06-05 22:15:40,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 687 transitions. [2021-06-05 22:15:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:40,135 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:40,135 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:40,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:40,336 INFO L430 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1248466919, now seen corresponding path program 48 times [2021-06-05 22:15:40,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:40,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724862144] [2021-06-05 22:15:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:40,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:40,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724862144] [2021-06-05 22:15:40,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724862144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:40,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294742282] [2021-06-05 22:15:40,367 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:40,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:40,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:40,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:40,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:40,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294742282] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:40,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:40,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:40,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698648887] [2021-06-05 22:15:40,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:40,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:40,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:40,448 INFO L87 Difference]: Start difference. First operand 229 states and 687 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:40,536 INFO L93 Difference]: Finished difference Result 320 states and 940 transitions. [2021-06-05 22:15:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:40,537 INFO L225 Difference]: With dead ends: 320 [2021-06-05 22:15:40,537 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 22:15:40,537 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 22:15:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 215. [2021-06-05 22:15:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.0046728971962615) internal successors, (643), 214 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 643 transitions. [2021-06-05 22:15:40,539 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 643 transitions. Word has length 19 [2021-06-05 22:15:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:40,539 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 643 transitions. [2021-06-05 22:15:40,539 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 643 transitions. [2021-06-05 22:15:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:40,540 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:40,540 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:40,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637,163 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:40,740 INFO L430 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1006159271, now seen corresponding path program 49 times [2021-06-05 22:15:40,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:40,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749421729] [2021-06-05 22:15:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:40,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:40,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749421729] [2021-06-05 22:15:40,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749421729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:40,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:40,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:40,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20457052] [2021-06-05 22:15:40,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:40,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:40,773 INFO L87 Difference]: Start difference. First operand 215 states and 643 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:40,872 INFO L93 Difference]: Finished difference Result 361 states and 1031 transitions. [2021-06-05 22:15:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:40,873 INFO L225 Difference]: With dead ends: 361 [2021-06-05 22:15:40,873 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 22:15:40,873 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 22:15:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 233. [2021-06-05 22:15:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.9956896551724137) internal successors, (695), 232 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 695 transitions. [2021-06-05 22:15:40,876 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 695 transitions. Word has length 19 [2021-06-05 22:15:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:40,876 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 695 transitions. [2021-06-05 22:15:40,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 695 transitions. [2021-06-05 22:15:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:40,877 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:40,877 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:40,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2021-06-05 22:15:40,877 INFO L430 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1386896911, now seen corresponding path program 50 times [2021-06-05 22:15:40,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:40,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183402550] [2021-06-05 22:15:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:40,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:40,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183402550] [2021-06-05 22:15:40,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183402550] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:40,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:40,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:40,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382935814] [2021-06-05 22:15:40,904 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:40,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:40,905 INFO L87 Difference]: Start difference. First operand 233 states and 695 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:41,008 INFO L93 Difference]: Finished difference Result 359 states and 1026 transitions. [2021-06-05 22:15:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:41,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:41,008 INFO L225 Difference]: With dead ends: 359 [2021-06-05 22:15:41,008 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 22:15:41,008 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 22:15:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 231. [2021-06-05 22:15:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 2.991304347826087) internal successors, (688), 230 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 688 transitions. [2021-06-05 22:15:41,011 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 688 transitions. Word has length 19 [2021-06-05 22:15:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:41,011 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 688 transitions. [2021-06-05 22:15:41,011 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 688 transitions. [2021-06-05 22:15:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:41,012 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:41,012 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:41,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2021-06-05 22:15:41,012 INFO L430 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1984233569, now seen corresponding path program 51 times [2021-06-05 22:15:41,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:41,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415613043] [2021-06-05 22:15:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:41,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:41,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415613043] [2021-06-05 22:15:41,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415613043] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:41,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:41,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:41,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161508921] [2021-06-05 22:15:41,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:41,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:41,037 INFO L87 Difference]: Start difference. First operand 231 states and 688 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:41,125 INFO L93 Difference]: Finished difference Result 373 states and 1067 transitions. [2021-06-05 22:15:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:41,126 INFO L225 Difference]: With dead ends: 373 [2021-06-05 22:15:41,126 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 22:15:41,126 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 67.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 22:15:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 229. [2021-06-05 22:15:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.991228070175439) internal successors, (682), 228 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 682 transitions. [2021-06-05 22:15:41,129 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 682 transitions. Word has length 19 [2021-06-05 22:15:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:41,129 INFO L482 AbstractCegarLoop]: Abstraction has 229 states and 682 transitions. [2021-06-05 22:15:41,129 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 682 transitions. [2021-06-05 22:15:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:41,130 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:41,130 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:41,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2021-06-05 22:15:41,130 INFO L430 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990024, now seen corresponding path program 49 times [2021-06-05 22:15:41,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:41,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766071992] [2021-06-05 22:15:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:41,163 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:41,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766071992] [2021-06-05 22:15:41,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766071992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:41,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885348497] [2021-06-05 22:15:41,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:41,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:41,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:41,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885348497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:41,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:41,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:41,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064906301] [2021-06-05 22:15:41,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:41,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:41,256 INFO L87 Difference]: Start difference. First operand 229 states and 682 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:41,346 INFO L93 Difference]: Finished difference Result 461 states and 1330 transitions. [2021-06-05 22:15:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:41,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:41,347 INFO L225 Difference]: With dead ends: 461 [2021-06-05 22:15:41,347 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 22:15:41,347 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 22:15:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 235. [2021-06-05 22:15:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.017094017094017) internal successors, (706), 234 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 706 transitions. [2021-06-05 22:15:41,350 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 706 transitions. Word has length 19 [2021-06-05 22:15:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:41,350 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 706 transitions. [2021-06-05 22:15:41,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 706 transitions. [2021-06-05 22:15:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:41,351 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:41,351 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:41,551 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable641 [2021-06-05 22:15:41,551 INFO L430 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -524828848, now seen corresponding path program 50 times [2021-06-05 22:15:41,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:41,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479064475] [2021-06-05 22:15:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:41,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:41,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479064475] [2021-06-05 22:15:41,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479064475] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:41,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061272033] [2021-06-05 22:15:41,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:41,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:41,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:41,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:41,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:41,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061272033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:41,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:41,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:41,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896843945] [2021-06-05 22:15:41,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:41,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:41,699 INFO L87 Difference]: Start difference. First operand 235 states and 706 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:41,811 INFO L93 Difference]: Finished difference Result 467 states and 1339 transitions. [2021-06-05 22:15:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:41,812 INFO L225 Difference]: With dead ends: 467 [2021-06-05 22:15:41,812 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 22:15:41,812 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 22:15:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 232. [2021-06-05 22:15:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 3.0043290043290045) internal successors, (694), 231 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 694 transitions. [2021-06-05 22:15:41,816 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 694 transitions. Word has length 19 [2021-06-05 22:15:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:41,817 INFO L482 AbstractCegarLoop]: Abstraction has 232 states and 694 transitions. [2021-06-05 22:15:41,817 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 694 transitions. [2021-06-05 22:15:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:41,817 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:41,817 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:42,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable642 [2021-06-05 22:15:42,033 INFO L430 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1537521380, now seen corresponding path program 51 times [2021-06-05 22:15:42,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:42,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450298085] [2021-06-05 22:15:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:42,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450298085] [2021-06-05 22:15:42,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450298085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:42,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785255692] [2021-06-05 22:15:42,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:42,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:42,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:42,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:42,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785255692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:42,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:42,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:42,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350705498] [2021-06-05 22:15:42,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:42,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:42,136 INFO L87 Difference]: Start difference. First operand 232 states and 694 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:42,207 INFO L93 Difference]: Finished difference Result 458 states and 1306 transitions. [2021-06-05 22:15:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:42,208 INFO L225 Difference]: With dead ends: 458 [2021-06-05 22:15:42,208 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 22:15:42,208 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 22:15:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 230. [2021-06-05 22:15:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.995633187772926) internal successors, (686), 229 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 686 transitions. [2021-06-05 22:15:42,211 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 686 transitions. Word has length 19 [2021-06-05 22:15:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:42,211 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 686 transitions. [2021-06-05 22:15:42,211 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 686 transitions. [2021-06-05 22:15:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:42,212 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:42,212 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:42,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645,166 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:42,412 INFO L430 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash 242250915, now seen corresponding path program 52 times [2021-06-05 22:15:42,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:42,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495068570] [2021-06-05 22:15:42,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:42,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495068570] [2021-06-05 22:15:42,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495068570] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:42,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:42,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:42,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659358101] [2021-06-05 22:15:42,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:42,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:42,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:42,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:42,454 INFO L87 Difference]: Start difference. First operand 230 states and 686 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:42,558 INFO L93 Difference]: Finished difference Result 403 states and 1125 transitions. [2021-06-05 22:15:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:42,559 INFO L225 Difference]: With dead ends: 403 [2021-06-05 22:15:42,559 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 22:15:42,559 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 22:15:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 242. [2021-06-05 22:15:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 3.037344398340249) internal successors, (732), 241 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 732 transitions. [2021-06-05 22:15:42,562 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 732 transitions. Word has length 19 [2021-06-05 22:15:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:42,562 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 732 transitions. [2021-06-05 22:15:42,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 732 transitions. [2021-06-05 22:15:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:42,563 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:42,563 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:42,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2021-06-05 22:15:42,563 INFO L430 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash 622988555, now seen corresponding path program 53 times [2021-06-05 22:15:42,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:42,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436127376] [2021-06-05 22:15:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:42,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436127376] [2021-06-05 22:15:42,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436127376] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:42,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:42,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:42,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024046027] [2021-06-05 22:15:42,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:42,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:42,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:42,592 INFO L87 Difference]: Start difference. First operand 242 states and 732 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:42,692 INFO L93 Difference]: Finished difference Result 409 states and 1140 transitions. [2021-06-05 22:15:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:42,693 INFO L225 Difference]: With dead ends: 409 [2021-06-05 22:15:42,693 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 22:15:42,693 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 22:15:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 244. [2021-06-05 22:15:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.02880658436214) internal successors, (736), 243 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 736 transitions. [2021-06-05 22:15:42,696 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 736 transitions. Word has length 19 [2021-06-05 22:15:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:42,696 INFO L482 AbstractCegarLoop]: Abstraction has 244 states and 736 transitions. [2021-06-05 22:15:42,696 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 736 transitions. [2021-06-05 22:15:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:42,696 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:42,696 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:42,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2021-06-05 22:15:42,696 INFO L430 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2120353452, now seen corresponding path program 52 times [2021-06-05 22:15:42,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:42,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309229768] [2021-06-05 22:15:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:42,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309229768] [2021-06-05 22:15:42,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309229768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:42,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268673838] [2021-06-05 22:15:42,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:42,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:42,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:42,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:42,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:42,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268673838] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:42,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:42,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:42,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725253424] [2021-06-05 22:15:42,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:42,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:42,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:42,822 INFO L87 Difference]: Start difference. First operand 244 states and 736 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:42,908 INFO L93 Difference]: Finished difference Result 532 states and 1524 transitions. [2021-06-05 22:15:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:42,909 INFO L225 Difference]: With dead ends: 532 [2021-06-05 22:15:42,909 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 22:15:42,909 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 22:15:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 250. [2021-06-05 22:15:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0642570281124497) internal successors, (763), 249 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 763 transitions. [2021-06-05 22:15:42,913 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 763 transitions. Word has length 19 [2021-06-05 22:15:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:42,913 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 763 transitions. [2021-06-05 22:15:42,913 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 763 transitions. [2021-06-05 22:15:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:42,913 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:42,913 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:43,113 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable650 [2021-06-05 22:15:43,114 INFO L430 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1190192276, now seen corresponding path program 53 times [2021-06-05 22:15:43,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:43,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200082131] [2021-06-05 22:15:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:43,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:43,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200082131] [2021-06-05 22:15:43,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200082131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:43,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185352795] [2021-06-05 22:15:43,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:43,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:43,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:43,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:43,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185352795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:43,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:43,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:43,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892327286] [2021-06-05 22:15:43,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:43,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:43,239 INFO L87 Difference]: Start difference. First operand 250 states and 763 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:43,334 INFO L93 Difference]: Finished difference Result 514 states and 1455 transitions. [2021-06-05 22:15:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:43,335 INFO L225 Difference]: With dead ends: 514 [2021-06-05 22:15:43,335 INFO L226 Difference]: Without dead ends: 508 [2021-06-05 22:15:43,335 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-06-05 22:15:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 249. [2021-06-05 22:15:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 3.056451612903226) internal successors, (758), 248 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 758 transitions. [2021-06-05 22:15:43,338 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 758 transitions. Word has length 19 [2021-06-05 22:15:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:43,338 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 758 transitions. [2021-06-05 22:15:43,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 758 transitions. [2021-06-05 22:15:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:43,338 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:43,338 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:43,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable651 [2021-06-05 22:15:43,539 INFO L430 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash 38116775, now seen corresponding path program 54 times [2021-06-05 22:15:43,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:43,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959787896] [2021-06-05 22:15:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:43,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:43,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959787896] [2021-06-05 22:15:43,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959787896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:43,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719645611] [2021-06-05 22:15:43,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:43,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:43,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:43,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:43,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:43,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719645611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:43,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:43,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:43,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039377955] [2021-06-05 22:15:43,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:43,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:43,658 INFO L87 Difference]: Start difference. First operand 249 states and 758 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:43,749 INFO L93 Difference]: Finished difference Result 375 states and 1066 transitions. [2021-06-05 22:15:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:43,750 INFO L225 Difference]: With dead ends: 375 [2021-06-05 22:15:43,750 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 22:15:43,750 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 22:15:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 249. [2021-06-05 22:15:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 3.068548387096774) internal successors, (761), 248 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 761 transitions. [2021-06-05 22:15:43,753 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 761 transitions. Word has length 19 [2021-06-05 22:15:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:43,753 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 761 transitions. [2021-06-05 22:15:43,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 761 transitions. [2021-06-05 22:15:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:43,753 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:43,753 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:43,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable654 [2021-06-05 22:15:43,954 INFO L430 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1919953796, now seen corresponding path program 54 times [2021-06-05 22:15:43,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:43,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260431373] [2021-06-05 22:15:43,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:43,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:43,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260431373] [2021-06-05 22:15:43,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260431373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:43,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754806172] [2021-06-05 22:15:43,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:44,015 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:15:44,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:44,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:44,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:44,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754806172] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:44,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:44,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:44,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408649628] [2021-06-05 22:15:44,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:44,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:44,083 INFO L87 Difference]: Start difference. First operand 249 states and 761 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:44,172 INFO L93 Difference]: Finished difference Result 459 states and 1316 transitions. [2021-06-05 22:15:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:44,173 INFO L225 Difference]: With dead ends: 459 [2021-06-05 22:15:44,173 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 22:15:44,173 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 22:15:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 240. [2021-06-05 22:15:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 3.0585774058577404) internal successors, (731), 239 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 731 transitions. [2021-06-05 22:15:44,176 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 731 transitions. Word has length 19 [2021-06-05 22:15:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:44,176 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 731 transitions. [2021-06-05 22:15:44,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 731 transitions. [2021-06-05 22:15:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:44,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:44,177 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:44,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 170 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable657 [2021-06-05 22:15:44,377 INFO L430 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2001194468, now seen corresponding path program 55 times [2021-06-05 22:15:44,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:44,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269912313] [2021-06-05 22:15:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:44,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:44,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269912313] [2021-06-05 22:15:44,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269912313] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:44,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656879228] [2021-06-05 22:15:44,414 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:44,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:44,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:44,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656879228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:44,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:44,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:44,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702868980] [2021-06-05 22:15:44,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:44,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:44,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:44,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:44,522 INFO L87 Difference]: Start difference. First operand 240 states and 731 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:44,624 INFO L93 Difference]: Finished difference Result 414 states and 1188 transitions. [2021-06-05 22:15:44,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:44,625 INFO L225 Difference]: With dead ends: 414 [2021-06-05 22:15:44,625 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 22:15:44,625 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 22:15:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 240. [2021-06-05 22:15:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 3.0418410041841004) internal successors, (727), 239 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 727 transitions. [2021-06-05 22:15:44,629 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 727 transitions. Word has length 19 [2021-06-05 22:15:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:44,629 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 727 transitions. [2021-06-05 22:15:44,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 727 transitions. [2021-06-05 22:15:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:44,630 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:44,630 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:44,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable658 [2021-06-05 22:15:44,841 INFO L430 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash 318111335, now seen corresponding path program 55 times [2021-06-05 22:15:44,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:44,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779230012] [2021-06-05 22:15:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:44,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:44,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779230012] [2021-06-05 22:15:44,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779230012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:44,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245784469] [2021-06-05 22:15:44,879 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:44,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:44,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:44,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245784469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:44,993 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:44,993 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:44,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154513091] [2021-06-05 22:15:44,993 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:44,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:44,994 INFO L87 Difference]: Start difference. First operand 240 states and 727 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,104 INFO L93 Difference]: Finished difference Result 347 states and 1016 transitions. [2021-06-05 22:15:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,105 INFO L225 Difference]: With dead ends: 347 [2021-06-05 22:15:45,105 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 22:15:45,105 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 22:15:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 236. [2021-06-05 22:15:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.0425531914893615) internal successors, (715), 235 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 715 transitions. [2021-06-05 22:15:45,107 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 715 transitions. Word has length 19 [2021-06-05 22:15:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,107 INFO L482 AbstractCegarLoop]: Abstraction has 236 states and 715 transitions. [2021-06-05 22:15:45,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 715 transitions. [2021-06-05 22:15:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,108 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,108 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:45,308 INFO L430 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1377350628, now seen corresponding path program 56 times [2021-06-05 22:15:45,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787520677] [2021-06-05 22:15:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787520677] [2021-06-05 22:15:45,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787520677] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355207584] [2021-06-05 22:15:45,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,344 INFO L87 Difference]: Start difference. First operand 236 states and 715 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,417 INFO L93 Difference]: Finished difference Result 452 states and 1270 transitions. [2021-06-05 22:15:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,418 INFO L225 Difference]: With dead ends: 452 [2021-06-05 22:15:45,418 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 22:15:45,418 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 22:15:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 246. [2021-06-05 22:15:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.020408163265306) internal successors, (740), 245 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 740 transitions. [2021-06-05 22:15:45,421 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 740 transitions. Word has length 19 [2021-06-05 22:15:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,421 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 740 transitions. [2021-06-05 22:15:45,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 740 transitions. [2021-06-05 22:15:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,422 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,422 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2021-06-05 22:15:45,422 INFO L430 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1815702516, now seen corresponding path program 57 times [2021-06-05 22:15:45,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764333543] [2021-06-05 22:15:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764333543] [2021-06-05 22:15:45,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764333543] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714568185] [2021-06-05 22:15:45,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,452 INFO L87 Difference]: Start difference. First operand 246 states and 740 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,520 INFO L93 Difference]: Finished difference Result 416 states and 1187 transitions. [2021-06-05 22:15:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,521 INFO L225 Difference]: With dead ends: 416 [2021-06-05 22:15:45,521 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 22:15:45,521 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 22:15:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 236. [2021-06-05 22:15:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.0382978723404257) internal successors, (714), 235 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 714 transitions. [2021-06-05 22:15:45,524 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 714 transitions. Word has length 19 [2021-06-05 22:15:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,524 INFO L482 AbstractCegarLoop]: Abstraction has 236 states and 714 transitions. [2021-06-05 22:15:45,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 714 transitions. [2021-06-05 22:15:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,525 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,525 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2021-06-05 22:15:45,525 INFO L430 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash -653338417, now seen corresponding path program 56 times [2021-06-05 22:15:45,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572247595] [2021-06-05 22:15:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572247595] [2021-06-05 22:15:45,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572247595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406493213] [2021-06-05 22:15:45,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,566 INFO L87 Difference]: Start difference. First operand 236 states and 714 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,681 INFO L93 Difference]: Finished difference Result 388 states and 1108 transitions. [2021-06-05 22:15:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,681 INFO L225 Difference]: With dead ends: 388 [2021-06-05 22:15:45,681 INFO L226 Difference]: Without dead ends: 382 [2021-06-05 22:15:45,681 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-06-05 22:15:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 248. [2021-06-05 22:15:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 3.0404858299595143) internal successors, (751), 247 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 751 transitions. [2021-06-05 22:15:45,684 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 751 transitions. Word has length 19 [2021-06-05 22:15:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,684 INFO L482 AbstractCegarLoop]: Abstraction has 248 states and 751 transitions. [2021-06-05 22:15:45,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 751 transitions. [2021-06-05 22:15:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,685 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,685 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2021-06-05 22:15:45,685 INFO L430 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash -382828725, now seen corresponding path program 57 times [2021-06-05 22:15:45,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669863880] [2021-06-05 22:15:45,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669863880] [2021-06-05 22:15:45,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669863880] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676783744] [2021-06-05 22:15:45,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,719 INFO L87 Difference]: Start difference. First operand 248 states and 751 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,839 INFO L93 Difference]: Finished difference Result 366 states and 1071 transitions. [2021-06-05 22:15:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,840 INFO L225 Difference]: With dead ends: 366 [2021-06-05 22:15:45,840 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 22:15:45,840 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 22:15:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 235. [2021-06-05 22:15:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.0384615384615383) internal successors, (711), 234 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 711 transitions. [2021-06-05 22:15:45,842 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 711 transitions. Word has length 19 [2021-06-05 22:15:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,842 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 711 transitions. [2021-06-05 22:15:45,843 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 711 transitions. [2021-06-05 22:15:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,843 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,843 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,843 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2021-06-05 22:15:45,843 INFO L430 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1250504300, now seen corresponding path program 58 times [2021-06-05 22:15:45,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184538335] [2021-06-05 22:15:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184538335] [2021-06-05 22:15:45,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184538335] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773978730] [2021-06-05 22:15:45,869 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,870 INFO L87 Difference]: Start difference. First operand 235 states and 711 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:45,937 INFO L93 Difference]: Finished difference Result 391 states and 1119 transitions. [2021-06-05 22:15:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:45,938 INFO L225 Difference]: With dead ends: 391 [2021-06-05 22:15:45,938 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 22:15:45,938 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 22:15:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 237. [2021-06-05 22:15:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 3.0254237288135593) internal successors, (714), 236 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 714 transitions. [2021-06-05 22:15:45,941 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 714 transitions. Word has length 19 [2021-06-05 22:15:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:45,941 INFO L482 AbstractCegarLoop]: Abstraction has 237 states and 714 transitions. [2021-06-05 22:15:45,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 714 transitions. [2021-06-05 22:15:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:45,941 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:45,941 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:45,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2021-06-05 22:15:45,942 INFO L430 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1644682960, now seen corresponding path program 59 times [2021-06-05 22:15:45,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:45,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991137792] [2021-06-05 22:15:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:45,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:45,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991137792] [2021-06-05 22:15:45,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991137792] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:45,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:45,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:45,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138955179] [2021-06-05 22:15:45,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:45,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:45,971 INFO L87 Difference]: Start difference. First operand 237 states and 714 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,039 INFO L93 Difference]: Finished difference Result 379 states and 1081 transitions. [2021-06-05 22:15:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,040 INFO L225 Difference]: With dead ends: 379 [2021-06-05 22:15:46,040 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 22:15:46,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 22:15:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2021-06-05 22:15:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 3.0040650406504064) internal successors, (739), 246 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 739 transitions. [2021-06-05 22:15:46,043 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 739 transitions. Word has length 19 [2021-06-05 22:15:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,043 INFO L482 AbstractCegarLoop]: Abstraction has 247 states and 739 transitions. [2021-06-05 22:15:46,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 739 transitions. [2021-06-05 22:15:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,043 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,043 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2021-06-05 22:15:46,043 INFO L430 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 542768808, now seen corresponding path program 60 times [2021-06-05 22:15:46,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245146524] [2021-06-05 22:15:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245146524] [2021-06-05 22:15:46,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245146524] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404984811] [2021-06-05 22:15:46,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,072 INFO L87 Difference]: Start difference. First operand 247 states and 739 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,130 INFO L93 Difference]: Finished difference Result 343 states and 998 transitions. [2021-06-05 22:15:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,131 INFO L225 Difference]: With dead ends: 343 [2021-06-05 22:15:46,131 INFO L226 Difference]: Without dead ends: 330 [2021-06-05 22:15:46,131 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-06-05 22:15:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 235. [2021-06-05 22:15:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.034188034188034) internal successors, (710), 234 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 710 transitions. [2021-06-05 22:15:46,134 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 710 transitions. Word has length 19 [2021-06-05 22:15:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,134 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 710 transitions. [2021-06-05 22:15:46,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 710 transitions. [2021-06-05 22:15:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,134 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,134 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2021-06-05 22:15:46,134 INFO L430 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1072803101, now seen corresponding path program 58 times [2021-06-05 22:15:46,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693701830] [2021-06-05 22:15:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693701830] [2021-06-05 22:15:46,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693701830] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910178595] [2021-06-05 22:15:46,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,162 INFO L87 Difference]: Start difference. First operand 235 states and 710 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,258 INFO L93 Difference]: Finished difference Result 325 states and 939 transitions. [2021-06-05 22:15:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,258 INFO L225 Difference]: With dead ends: 325 [2021-06-05 22:15:46,258 INFO L226 Difference]: Without dead ends: 313 [2021-06-05 22:15:46,258 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-06-05 22:15:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 235. [2021-06-05 22:15:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.02991452991453) internal successors, (709), 234 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 709 transitions. [2021-06-05 22:15:46,261 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 709 transitions. Word has length 19 [2021-06-05 22:15:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,261 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 709 transitions. [2021-06-05 22:15:46,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 709 transitions. [2021-06-05 22:15:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,262 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,262 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2021-06-05 22:15:46,262 INFO L430 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2138427743, now seen corresponding path program 59 times [2021-06-05 22:15:46,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218155134] [2021-06-05 22:15:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218155134] [2021-06-05 22:15:46,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218155134] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042728641] [2021-06-05 22:15:46,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,293 INFO L87 Difference]: Start difference. First operand 235 states and 709 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,396 INFO L93 Difference]: Finished difference Result 329 states and 951 transitions. [2021-06-05 22:15:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,397 INFO L225 Difference]: With dead ends: 329 [2021-06-05 22:15:46,397 INFO L226 Difference]: Without dead ends: 323 [2021-06-05 22:15:46,397 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-06-05 22:15:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 241. [2021-06-05 22:15:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 3.0125) internal successors, (723), 240 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 723 transitions. [2021-06-05 22:15:46,399 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 723 transitions. Word has length 19 [2021-06-05 22:15:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,399 INFO L482 AbstractCegarLoop]: Abstraction has 241 states and 723 transitions. [2021-06-05 22:15:46,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 723 transitions. [2021-06-05 22:15:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,400 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,400 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2021-06-05 22:15:46,400 INFO L430 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1867918051, now seen corresponding path program 60 times [2021-06-05 22:15:46,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207378880] [2021-06-05 22:15:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207378880] [2021-06-05 22:15:46,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207378880] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578049028] [2021-06-05 22:15:46,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,434 INFO L87 Difference]: Start difference. First operand 241 states and 723 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,539 INFO L93 Difference]: Finished difference Result 294 states and 876 transitions. [2021-06-05 22:15:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,540 INFO L225 Difference]: With dead ends: 294 [2021-06-05 22:15:46,540 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 22:15:46,540 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 22:15:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 217. [2021-06-05 22:15:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 3.009259259259259) internal successors, (650), 216 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 650 transitions. [2021-06-05 22:15:46,543 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 650 transitions. Word has length 19 [2021-06-05 22:15:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,543 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 650 transitions. [2021-06-05 22:15:46,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 650 transitions. [2021-06-05 22:15:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,543 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,543 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2021-06-05 22:15:46,543 INFO L430 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1028896921, now seen corresponding path program 61 times [2021-06-05 22:15:46,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676707611] [2021-06-05 22:15:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676707611] [2021-06-05 22:15:46,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676707611] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742119514] [2021-06-05 22:15:46,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,569 INFO L87 Difference]: Start difference. First operand 217 states and 650 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,633 INFO L93 Difference]: Finished difference Result 362 states and 1019 transitions. [2021-06-05 22:15:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,634 INFO L225 Difference]: With dead ends: 362 [2021-06-05 22:15:46,634 INFO L226 Difference]: Without dead ends: 346 [2021-06-05 22:15:46,634 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-06-05 22:15:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 219. [2021-06-05 22:15:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.9954128440366974) internal successors, (653), 218 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 653 transitions. [2021-06-05 22:15:46,636 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 653 transitions. Word has length 19 [2021-06-05 22:15:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,636 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 653 transitions. [2021-06-05 22:15:46,636 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 653 transitions. [2021-06-05 22:15:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,637 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,637 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2021-06-05 22:15:46,637 INFO L430 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,637 INFO L82 PathProgramCache]: Analyzing trace with hash 493077425, now seen corresponding path program 62 times [2021-06-05 22:15:46,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095228454] [2021-06-05 22:15:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095228454] [2021-06-05 22:15:46,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095228454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241851135] [2021-06-05 22:15:46,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,666 INFO L87 Difference]: Start difference. First operand 219 states and 653 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,752 INFO L93 Difference]: Finished difference Result 391 states and 1075 transitions. [2021-06-05 22:15:46,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,753 INFO L225 Difference]: With dead ends: 391 [2021-06-05 22:15:46,753 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 22:15:46,753 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 22:15:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 231. [2021-06-05 22:15:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 2.9695652173913043) internal successors, (683), 230 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 683 transitions. [2021-06-05 22:15:46,756 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 683 transitions. Word has length 19 [2021-06-05 22:15:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,756 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 683 transitions. [2021-06-05 22:15:46,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 683 transitions. [2021-06-05 22:15:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,756 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,756 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2021-06-05 22:15:46,756 INFO L430 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 873815065, now seen corresponding path program 63 times [2021-06-05 22:15:46,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053241976] [2021-06-05 22:15:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053241976] [2021-06-05 22:15:46,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053241976] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709169607] [2021-06-05 22:15:46,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,785 INFO L87 Difference]: Start difference. First operand 231 states and 683 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,865 INFO L93 Difference]: Finished difference Result 354 states and 997 transitions. [2021-06-05 22:15:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,865 INFO L225 Difference]: With dead ends: 354 [2021-06-05 22:15:46,865 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 22:15:46,865 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 22:15:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 217. [2021-06-05 22:15:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 3.0) internal successors, (648), 216 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 648 transitions. [2021-06-05 22:15:46,868 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 648 transitions. Word has length 19 [2021-06-05 22:15:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,868 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 648 transitions. [2021-06-05 22:15:46,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 648 transitions. [2021-06-05 22:15:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,868 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,868 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2021-06-05 22:15:46,869 INFO L430 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1196865479, now seen corresponding path program 64 times [2021-06-05 22:15:46,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462446823] [2021-06-05 22:15:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:46,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:46,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462446823] [2021-06-05 22:15:46,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462446823] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:46,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:46,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:46,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900930167] [2021-06-05 22:15:46,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:46,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:46,897 INFO L87 Difference]: Start difference. First operand 217 states and 648 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:46,982 INFO L93 Difference]: Finished difference Result 397 states and 1090 transitions. [2021-06-05 22:15:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:46,983 INFO L225 Difference]: With dead ends: 397 [2021-06-05 22:15:46,983 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 22:15:46,983 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 22:15:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 233. [2021-06-05 22:15:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.9741379310344827) internal successors, (690), 232 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 690 transitions. [2021-06-05 22:15:46,986 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 690 transitions. Word has length 19 [2021-06-05 22:15:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:46,986 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 690 transitions. [2021-06-05 22:15:46,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 690 transitions. [2021-06-05 22:15:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:46,986 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:46,986 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:46,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2021-06-05 22:15:46,987 INFO L430 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash -816127839, now seen corresponding path program 65 times [2021-06-05 22:15:46,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:46,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523090045] [2021-06-05 22:15:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:47,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523090045] [2021-06-05 22:15:47,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523090045] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:47,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:47,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:47,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510288735] [2021-06-05 22:15:47,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:47,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:47,016 INFO L87 Difference]: Start difference. First operand 233 states and 690 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:47,102 INFO L93 Difference]: Finished difference Result 395 states and 1085 transitions. [2021-06-05 22:15:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:47,103 INFO L225 Difference]: With dead ends: 395 [2021-06-05 22:15:47,103 INFO L226 Difference]: Without dead ends: 387 [2021-06-05 22:15:47,103 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-06-05 22:15:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 231. [2021-06-05 22:15:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 2.9695652173913043) internal successors, (683), 230 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 683 transitions. [2021-06-05 22:15:47,106 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 683 transitions. Word has length 19 [2021-06-05 22:15:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:47,106 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 683 transitions. [2021-06-05 22:15:47,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 683 transitions. [2021-06-05 22:15:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:47,107 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:47,107 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:47,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2021-06-05 22:15:47,107 INFO L430 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -218791181, now seen corresponding path program 66 times [2021-06-05 22:15:47,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:47,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4903542] [2021-06-05 22:15:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:47,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4903542] [2021-06-05 22:15:47,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4903542] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:47,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:47,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:47,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687849460] [2021-06-05 22:15:47,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:47,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:47,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:47,134 INFO L87 Difference]: Start difference. First operand 231 states and 683 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:47,198 INFO L93 Difference]: Finished difference Result 358 states and 1005 transitions. [2021-06-05 22:15:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:47,198 INFO L225 Difference]: With dead ends: 358 [2021-06-05 22:15:47,199 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 22:15:47,199 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 22:15:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 215. [2021-06-05 22:15:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.0093457943925235) internal successors, (644), 214 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 22:15:47,201 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 22:15:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:47,201 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 22:15:47,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 22:15:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:47,202 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:47,202 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:47,202 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2021-06-05 22:15:47,202 INFO L430 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 313632770, now seen corresponding path program 61 times [2021-06-05 22:15:47,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:47,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690598057] [2021-06-05 22:15:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:47,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690598057] [2021-06-05 22:15:47,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690598057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:47,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758602943] [2021-06-05 22:15:47,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:47,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:47,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758602943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:47,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:47,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:47,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605146265] [2021-06-05 22:15:47,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:47,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:47,302 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:47,380 INFO L93 Difference]: Finished difference Result 390 states and 1140 transitions. [2021-06-05 22:15:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:47,381 INFO L225 Difference]: With dead ends: 390 [2021-06-05 22:15:47,381 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 22:15:47,381 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 22:15:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 218. [2021-06-05 22:15:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.0092165898617513) internal successors, (653), 217 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2021-06-05 22:15:47,383 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2021-06-05 22:15:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:47,383 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2021-06-05 22:15:47,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2021-06-05 22:15:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:47,384 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:47,384 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:47,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 173 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable678 [2021-06-05 22:15:47,584 INFO L430 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 157800938, now seen corresponding path program 62 times [2021-06-05 22:15:47,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:47,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297529557] [2021-06-05 22:15:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:47,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297529557] [2021-06-05 22:15:47,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297529557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:47,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743879910] [2021-06-05 22:15:47,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:47,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:47,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:47,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:47,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:47,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743879910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:47,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:47,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:47,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925247893] [2021-06-05 22:15:47,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:47,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:47,692 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:47,777 INFO L93 Difference]: Finished difference Result 453 states and 1308 transitions. [2021-06-05 22:15:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:47,778 INFO L225 Difference]: With dead ends: 453 [2021-06-05 22:15:47,778 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 22:15:47,778 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 22:15:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 221. [2021-06-05 22:15:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.022727272727273) internal successors, (665), 220 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 665 transitions. [2021-06-05 22:15:47,781 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 665 transitions. Word has length 19 [2021-06-05 22:15:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:47,781 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 665 transitions. [2021-06-05 22:15:47,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 665 transitions. [2021-06-05 22:15:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:47,781 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:47,781 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:47,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:47,982 INFO L430 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1087962114, now seen corresponding path program 63 times [2021-06-05 22:15:47,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:47,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856457678] [2021-06-05 22:15:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:48,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856457678] [2021-06-05 22:15:48,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856457678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784911048] [2021-06-05 22:15:48,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:48,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:48,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:48,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:48,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784911048] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:48,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:48,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958412364] [2021-06-05 22:15:48,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:48,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:48,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:48,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:48,079 INFO L87 Difference]: Start difference. First operand 221 states and 665 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:48,168 INFO L93 Difference]: Finished difference Result 399 states and 1161 transitions. [2021-06-05 22:15:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:48,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:48,169 INFO L225 Difference]: With dead ends: 399 [2021-06-05 22:15:48,169 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 22:15:48,169 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 22:15:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 215. [2021-06-05 22:15:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.0093457943925235) internal successors, (644), 214 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 22:15:48,171 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 22:15:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:48,172 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 22:15:48,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 22:15:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:48,172 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:48,172 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:48,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680,175 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:48,372 INFO L430 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash -727997342, now seen corresponding path program 64 times [2021-06-05 22:15:48,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:48,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593235554] [2021-06-05 22:15:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:48,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593235554] [2021-06-05 22:15:48,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593235554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868267014] [2021-06-05 22:15:48,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:48,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:48,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:48,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:48,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868267014] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:48,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:48,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55706102] [2021-06-05 22:15:48,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:48,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:48,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:48,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:48,488 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:48,588 INFO L93 Difference]: Finished difference Result 423 states and 1218 transitions. [2021-06-05 22:15:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:48,589 INFO L225 Difference]: With dead ends: 423 [2021-06-05 22:15:48,589 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 22:15:48,590 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 22:15:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 221. [2021-06-05 22:15:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.036363636363636) internal successors, (668), 220 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 668 transitions. [2021-06-05 22:15:48,592 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 668 transitions. Word has length 19 [2021-06-05 22:15:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:48,593 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 668 transitions. [2021-06-05 22:15:48,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 668 transitions. [2021-06-05 22:15:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:48,593 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:48,593 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:48,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 176 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable683 [2021-06-05 22:15:48,793 INFO L430 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 202163834, now seen corresponding path program 65 times [2021-06-05 22:15:48,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:48,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815544920] [2021-06-05 22:15:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:48,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815544920] [2021-06-05 22:15:48,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815544920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419333324] [2021-06-05 22:15:48,821 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:48,848 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:48,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:48,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:48,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:48,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419333324] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:48,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:48,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:48,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626181066] [2021-06-05 22:15:48,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:48,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:48,900 INFO L87 Difference]: Start difference. First operand 221 states and 668 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:48,987 INFO L93 Difference]: Finished difference Result 429 states and 1227 transitions. [2021-06-05 22:15:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:48,988 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:15:48,988 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 22:15:48,988 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 22:15:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 218. [2021-06-05 22:15:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 3.0230414746543777) internal successors, (656), 217 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2021-06-05 22:15:48,991 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2021-06-05 22:15:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:48,991 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2021-06-05 22:15:48,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2021-06-05 22:15:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:48,991 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:48,991 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:49,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 177 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable684 [2021-06-05 22:15:49,192 INFO L430 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash -810528698, now seen corresponding path program 66 times [2021-06-05 22:15:49,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:49,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337643695] [2021-06-05 22:15:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:49,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337643695] [2021-06-05 22:15:49,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337643695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:49,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440355279] [2021-06-05 22:15:49,218 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:49,245 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:49,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:49,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:49,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440355279] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:49,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:49,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:49,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702865200] [2021-06-05 22:15:49,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:49,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:49,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:49,300 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:49,375 INFO L93 Difference]: Finished difference Result 378 states and 1095 transitions. [2021-06-05 22:15:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:49,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:49,376 INFO L225 Difference]: With dead ends: 378 [2021-06-05 22:15:49,376 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 22:15:49,376 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 22:15:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 215. [2021-06-05 22:15:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.0093457943925235) internal successors, (644), 214 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 22:15:49,379 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 22:15:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:49,379 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 22:15:49,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 22:15:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:49,379 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:49,379 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:49,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable687 [2021-06-05 22:15:49,579 INFO L430 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1177425635, now seen corresponding path program 67 times [2021-06-05 22:15:49,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:49,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579284190] [2021-06-05 22:15:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:49,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579284190] [2021-06-05 22:15:49,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579284190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:49,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:49,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:49,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496877512] [2021-06-05 22:15:49,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:49,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:49,606 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:49,670 INFO L93 Difference]: Finished difference Result 416 states and 1156 transitions. [2021-06-05 22:15:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:49,671 INFO L225 Difference]: With dead ends: 416 [2021-06-05 22:15:49,671 INFO L226 Difference]: Without dead ends: 400 [2021-06-05 22:15:49,671 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-06-05 22:15:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 219. [2021-06-05 22:15:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.9908256880733943) internal successors, (652), 218 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2021-06-05 22:15:49,675 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2021-06-05 22:15:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:49,675 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2021-06-05 22:15:49,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2021-06-05 22:15:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:49,676 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:49,676 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:49,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2021-06-05 22:15:49,676 INFO L430 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1713245131, now seen corresponding path program 68 times [2021-06-05 22:15:49,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:49,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281385736] [2021-06-05 22:15:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:49,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281385736] [2021-06-05 22:15:49,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281385736] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:49,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:49,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:49,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611898405] [2021-06-05 22:15:49,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:49,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:49,707 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:49,784 INFO L93 Difference]: Finished difference Result 445 states and 1210 transitions. [2021-06-05 22:15:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:49,785 INFO L225 Difference]: With dead ends: 445 [2021-06-05 22:15:49,785 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 22:15:49,785 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 22:15:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 235. [2021-06-05 22:15:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.9743589743589745) internal successors, (696), 234 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 696 transitions. [2021-06-05 22:15:49,788 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 696 transitions. Word has length 19 [2021-06-05 22:15:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:49,788 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 696 transitions. [2021-06-05 22:15:49,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 696 transitions. [2021-06-05 22:15:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:49,788 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:49,788 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:49,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2021-06-05 22:15:49,788 INFO L430 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1332507491, now seen corresponding path program 69 times [2021-06-05 22:15:49,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:49,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622659038] [2021-06-05 22:15:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:49,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622659038] [2021-06-05 22:15:49,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622659038] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:49,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:49,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:49,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098488719] [2021-06-05 22:15:49,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:49,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:49,816 INFO L87 Difference]: Start difference. First operand 235 states and 696 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:49,883 INFO L93 Difference]: Finished difference Result 408 states and 1124 transitions. [2021-06-05 22:15:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:49,883 INFO L225 Difference]: With dead ends: 408 [2021-06-05 22:15:49,883 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 22:15:49,883 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 22:15:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 225. [2021-06-05 22:15:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.982142857142857) internal successors, (668), 224 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 668 transitions. [2021-06-05 22:15:49,887 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 668 transitions. Word has length 19 [2021-06-05 22:15:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:49,887 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 668 transitions. [2021-06-05 22:15:49,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 668 transitions. [2021-06-05 22:15:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:49,888 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:49,888 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:49,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2021-06-05 22:15:49,888 INFO L430 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:49,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1162202982, now seen corresponding path program 67 times [2021-06-05 22:15:49,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:49,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697956515] [2021-06-05 22:15:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:49,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697956515] [2021-06-05 22:15:49,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697956515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:49,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319821492] [2021-06-05 22:15:49,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:49,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:49,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:49,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319821492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:49,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:49,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:49,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293459011] [2021-06-05 22:15:49,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:49,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:49,981 INFO L87 Difference]: Start difference. First operand 225 states and 668 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:50,076 INFO L93 Difference]: Finished difference Result 510 states and 1495 transitions. [2021-06-05 22:15:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:50,081 INFO L225 Difference]: With dead ends: 510 [2021-06-05 22:15:50,081 INFO L226 Difference]: Without dead ends: 510 [2021-06-05 22:15:50,081 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-06-05 22:15:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 225. [2021-06-05 22:15:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.982142857142857) internal successors, (668), 224 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 668 transitions. [2021-06-05 22:15:50,084 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 668 transitions. Word has length 19 [2021-06-05 22:15:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:50,084 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 668 transitions. [2021-06-05 22:15:50,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 668 transitions. [2021-06-05 22:15:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:50,085 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:50,085 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:50,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693,179 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:50,285 INFO L430 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1006371150, now seen corresponding path program 68 times [2021-06-05 22:15:50,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:50,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568261365] [2021-06-05 22:15:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:50,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:50,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568261365] [2021-06-05 22:15:50,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568261365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:50,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062562510] [2021-06-05 22:15:50,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:50,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:50,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:50,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:50,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:50,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062562510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:50,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:50,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:50,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127804138] [2021-06-05 22:15:50,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:50,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:50,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:50,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:50,389 INFO L87 Difference]: Start difference. First operand 225 states and 668 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:50,473 INFO L93 Difference]: Finished difference Result 528 states and 1528 transitions. [2021-06-05 22:15:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:50,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:50,474 INFO L225 Difference]: With dead ends: 528 [2021-06-05 22:15:50,474 INFO L226 Difference]: Without dead ends: 528 [2021-06-05 22:15:50,474 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-06-05 22:15:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 231. [2021-06-05 22:15:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 3.0217391304347827) internal successors, (695), 230 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 695 transitions. [2021-06-05 22:15:50,478 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 695 transitions. Word has length 19 [2021-06-05 22:15:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:50,478 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 695 transitions. [2021-06-05 22:15:50,478 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 695 transitions. [2021-06-05 22:15:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:50,478 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:50,478 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:50,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:50,678 INFO L430 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1936532326, now seen corresponding path program 69 times [2021-06-05 22:15:50,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:50,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428749830] [2021-06-05 22:15:50,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:50,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:50,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428749830] [2021-06-05 22:15:50,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428749830] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:50,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429764131] [2021-06-05 22:15:50,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:50,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:50,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:50,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:50,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:50,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429764131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:50,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:50,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:50,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975925777] [2021-06-05 22:15:50,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:50,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:50,777 INFO L87 Difference]: Start difference. First operand 231 states and 695 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:50,856 INFO L93 Difference]: Finished difference Result 474 states and 1375 transitions. [2021-06-05 22:15:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:50,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:50,857 INFO L225 Difference]: With dead ends: 474 [2021-06-05 22:15:50,857 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 22:15:50,857 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 22:15:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 227. [2021-06-05 22:15:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 3.0132743362831858) internal successors, (681), 226 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 681 transitions. [2021-06-05 22:15:50,860 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 681 transitions. Word has length 19 [2021-06-05 22:15:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:50,861 INFO L482 AbstractCegarLoop]: Abstraction has 227 states and 681 transitions. [2021-06-05 22:15:50,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 681 transitions. [2021-06-05 22:15:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:50,861 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:50,861 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:51,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 181 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable695 [2021-06-05 22:15:51,062 INFO L430 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1084350617, now seen corresponding path program 70 times [2021-06-05 22:15:51,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:51,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079459580] [2021-06-05 22:15:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:51,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079459580] [2021-06-05 22:15:51,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079459580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805328283] [2021-06-05 22:15:51,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:51,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:51,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:51,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:51,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805328283] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:51,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:51,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685237946] [2021-06-05 22:15:51,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:51,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:51,164 INFO L87 Difference]: Start difference. First operand 227 states and 681 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:51,235 INFO L93 Difference]: Finished difference Result 367 states and 1041 transitions. [2021-06-05 22:15:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:51,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:51,235 INFO L225 Difference]: With dead ends: 367 [2021-06-05 22:15:51,235 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 22:15:51,235 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 65.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 22:15:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 221. [2021-06-05 22:15:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.0) internal successors, (660), 220 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 660 transitions. [2021-06-05 22:15:51,238 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 660 transitions. Word has length 19 [2021-06-05 22:15:51,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:51,238 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 660 transitions. [2021-06-05 22:15:51,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 660 transitions. [2021-06-05 22:15:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:51,239 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:51,239 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:51,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:51,439 INFO L430 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1215342274, now seen corresponding path program 70 times [2021-06-05 22:15:51,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:51,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301142491] [2021-06-05 22:15:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:51,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301142491] [2021-06-05 22:15:51,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301142491] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607150034] [2021-06-05 22:15:51,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:51,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:51,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:51,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:51,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607150034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:51,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 22:15:51,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051061540] [2021-06-05 22:15:51,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 22:15:51,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 22:15:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 22:15:51,550 INFO L87 Difference]: Start difference. First operand 221 states and 660 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:51,640 INFO L93 Difference]: Finished difference Result 404 states and 1187 transitions. [2021-06-05 22:15:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:51,641 INFO L225 Difference]: With dead ends: 404 [2021-06-05 22:15:51,642 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:15:51,642 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:15:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 200. [2021-06-05 22:15:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.9849246231155777) internal successors, (594), 199 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 594 transitions. [2021-06-05 22:15:51,645 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 594 transitions. Word has length 19 [2021-06-05 22:15:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:51,645 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 594 transitions. [2021-06-05 22:15:51,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 594 transitions. [2021-06-05 22:15:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:51,646 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:51,646 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:51,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable701 [2021-06-05 22:15:51,869 INFO L430 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1597715687, now seen corresponding path program 71 times [2021-06-05 22:15:51,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:51,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484732300] [2021-06-05 22:15:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:51,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484732300] [2021-06-05 22:15:51,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484732300] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531668093] [2021-06-05 22:15:51,901 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:51,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:51,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:51,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:51,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:51,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531668093] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:51,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:51,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:51,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762620362] [2021-06-05 22:15:51,989 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:51,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:51,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:51,989 INFO L87 Difference]: Start difference. First operand 200 states and 594 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:52,081 INFO L93 Difference]: Finished difference Result 356 states and 1020 transitions. [2021-06-05 22:15:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:52,082 INFO L225 Difference]: With dead ends: 356 [2021-06-05 22:15:52,082 INFO L226 Difference]: Without dead ends: 348 [2021-06-05 22:15:52,082 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-06-05 22:15:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 216. [2021-06-05 22:15:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.0232558139534884) internal successors, (650), 215 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2021-06-05 22:15:52,085 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2021-06-05 22:15:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:52,085 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2021-06-05 22:15:52,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2021-06-05 22:15:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:52,085 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:52,085 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:52,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702,184 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:52,286 INFO L430 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1565768734, now seen corresponding path program 71 times [2021-06-05 22:15:52,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:52,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330013260] [2021-06-05 22:15:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:52,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:52,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330013260] [2021-06-05 22:15:52,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330013260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:52,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825294578] [2021-06-05 22:15:52,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:52,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:52,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:52,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:52,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:52,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825294578] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:52,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:52,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:52,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254173728] [2021-06-05 22:15:52,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:52,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:52,404 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:52,494 INFO L93 Difference]: Finished difference Result 393 states and 1145 transitions. [2021-06-05 22:15:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:52,495 INFO L225 Difference]: With dead ends: 393 [2021-06-05 22:15:52,495 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 22:15:52,495 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 71.4ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 22:15:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2021-06-05 22:15:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.0232558139534884) internal successors, (650), 215 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2021-06-05 22:15:52,498 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2021-06-05 22:15:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:52,498 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2021-06-05 22:15:52,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2021-06-05 22:15:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:52,498 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:52,498 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:52,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable705 [2021-06-05 22:15:52,699 INFO L430 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 857230482, now seen corresponding path program 72 times [2021-06-05 22:15:52,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:52,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92089985] [2021-06-05 22:15:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:52,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:52,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92089985] [2021-06-05 22:15:52,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92089985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:52,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267401034] [2021-06-05 22:15:52,730 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:52,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:52,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:52,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:52,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:52,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267401034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:52,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:52,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 22:15:52,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367077311] [2021-06-05 22:15:52,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 22:15:52,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 22:15:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 22:15:52,810 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:52,890 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2021-06-05 22:15:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:52,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:52,890 INFO L225 Difference]: With dead ends: 339 [2021-06-05 22:15:52,891 INFO L226 Difference]: Without dead ends: 330 [2021-06-05 22:15:52,891 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-06-05 22:15:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 216. [2021-06-05 22:15:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.0046511627906978) internal successors, (646), 215 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 646 transitions. [2021-06-05 22:15:52,893 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 646 transitions. Word has length 19 [2021-06-05 22:15:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:52,893 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 646 transitions. [2021-06-05 22:15:52,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 646 transitions. [2021-06-05 22:15:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:52,894 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:52,894 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:53,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706,186 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:53,094 INFO L430 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1118431011, now seen corresponding path program 72 times [2021-06-05 22:15:53,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:53,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811480648] [2021-06-05 22:15:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:53,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811480648] [2021-06-05 22:15:53,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811480648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:53,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344419396] [2021-06-05 22:15:53,129 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:53,156 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:53,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:53,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:53,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344419396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:53,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:53,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:53,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292359975] [2021-06-05 22:15:53,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:53,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:53,220 INFO L87 Difference]: Start difference. First operand 216 states and 646 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:53,321 INFO L93 Difference]: Finished difference Result 310 states and 907 transitions. [2021-06-05 22:15:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:53,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:53,322 INFO L225 Difference]: With dead ends: 310 [2021-06-05 22:15:53,322 INFO L226 Difference]: Without dead ends: 310 [2021-06-05 22:15:53,322 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-06-05 22:15:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 196. [2021-06-05 22:15:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.9846153846153847) internal successors, (582), 195 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 582 transitions. [2021-06-05 22:15:53,325 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 582 transitions. Word has length 19 [2021-06-05 22:15:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:53,325 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 582 transitions. [2021-06-05 22:15:53,325 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 582 transitions. [2021-06-05 22:15:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:53,325 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:53,325 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:53,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:53,525 INFO L430 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -720751567, now seen corresponding path program 73 times [2021-06-05 22:15:53,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:53,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839489363] [2021-06-05 22:15:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:53,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839489363] [2021-06-05 22:15:53,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839489363] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:53,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:53,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:53,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596724027] [2021-06-05 22:15:53,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:53,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:53,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:53,555 INFO L87 Difference]: Start difference. First operand 196 states and 582 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:53,636 INFO L93 Difference]: Finished difference Result 415 states and 1176 transitions. [2021-06-05 22:15:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:53,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:53,637 INFO L225 Difference]: With dead ends: 415 [2021-06-05 22:15:53,637 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 22:15:53,637 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 22:15:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 216. [2021-06-05 22:15:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.013953488372093) internal successors, (648), 215 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2021-06-05 22:15:53,640 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2021-06-05 22:15:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:53,640 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2021-06-05 22:15:53,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2021-06-05 22:15:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:53,640 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:53,640 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:53,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2021-06-05 22:15:53,640 INFO L430 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash -340013927, now seen corresponding path program 74 times [2021-06-05 22:15:53,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:53,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064504029] [2021-06-05 22:15:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:53,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064504029] [2021-06-05 22:15:53,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064504029] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:53,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:53,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:53,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16017388] [2021-06-05 22:15:53,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:53,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:53,670 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:53,750 INFO L93 Difference]: Finished difference Result 421 states and 1191 transitions. [2021-06-05 22:15:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:53,751 INFO L225 Difference]: With dead ends: 421 [2021-06-05 22:15:53,751 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 22:15:53,751 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 22:15:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 220. [2021-06-05 22:15:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 3.0) internal successors, (657), 219 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 657 transitions. [2021-06-05 22:15:53,753 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 657 transitions. Word has length 19 [2021-06-05 22:15:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:53,754 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 657 transitions. [2021-06-05 22:15:53,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 657 transitions. [2021-06-05 22:15:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:53,754 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:53,754 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:53,754 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2021-06-05 22:15:53,754 INFO L430 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1211611362, now seen corresponding path program 73 times [2021-06-05 22:15:53,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:53,754 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317014216] [2021-06-05 22:15:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:53,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317014216] [2021-06-05 22:15:53,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317014216] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:53,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824395986] [2021-06-05 22:15:53,785 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:53,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:53,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:53,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824395986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:53,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:53,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:53,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146506249] [2021-06-05 22:15:53,864 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:53,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:53,864 INFO L87 Difference]: Start difference. First operand 220 states and 657 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:53,956 INFO L93 Difference]: Finished difference Result 479 states and 1393 transitions. [2021-06-05 22:15:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:53,957 INFO L225 Difference]: With dead ends: 479 [2021-06-05 22:15:53,957 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 22:15:53,957 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 22:15:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 226. [2021-06-05 22:15:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 3.04) internal successors, (684), 225 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 684 transitions. [2021-06-05 22:15:53,960 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 684 transitions. Word has length 19 [2021-06-05 22:15:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:53,960 INFO L482 AbstractCegarLoop]: Abstraction has 226 states and 684 transitions. [2021-06-05 22:15:53,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 684 transitions. [2021-06-05 22:15:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:53,961 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:53,961 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:54,161 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable712 [2021-06-05 22:15:54,161 INFO L430 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2141772538, now seen corresponding path program 74 times [2021-06-05 22:15:54,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:54,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833215708] [2021-06-05 22:15:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:54,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:54,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833215708] [2021-06-05 22:15:54,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833215708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:54,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833974381] [2021-06-05 22:15:54,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:54,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:54,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:54,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:54,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:54,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833974381] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:54,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:54,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:54,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833969455] [2021-06-05 22:15:54,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:54,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:54,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:54,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:54,266 INFO L87 Difference]: Start difference. First operand 226 states and 684 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:54,368 INFO L93 Difference]: Finished difference Result 461 states and 1324 transitions. [2021-06-05 22:15:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:54,369 INFO L225 Difference]: With dead ends: 461 [2021-06-05 22:15:54,369 INFO L226 Difference]: Without dead ends: 455 [2021-06-05 22:15:54,369 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-06-05 22:15:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 225. [2021-06-05 22:15:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 3.03125) internal successors, (679), 224 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 679 transitions. [2021-06-05 22:15:54,372 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 679 transitions. Word has length 19 [2021-06-05 22:15:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:54,372 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 679 transitions. [2021-06-05 22:15:54,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 679 transitions. [2021-06-05 22:15:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:54,373 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:54,373 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:54,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:54,573 INFO L430 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -924885707, now seen corresponding path program 75 times [2021-06-05 22:15:54,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:54,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427742222] [2021-06-05 22:15:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:54,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:54,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427742222] [2021-06-05 22:15:54,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427742222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:54,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256816961] [2021-06-05 22:15:54,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:54,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:54,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:54,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:54,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:54,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256816961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:54,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:54,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:54,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457717008] [2021-06-05 22:15:54,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:54,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:54,701 INFO L87 Difference]: Start difference. First operand 225 states and 679 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:54,796 INFO L93 Difference]: Finished difference Result 439 states and 1238 transitions. [2021-06-05 22:15:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:54,796 INFO L225 Difference]: With dead ends: 439 [2021-06-05 22:15:54,796 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 22:15:54,797 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 22:15:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 225. [2021-06-05 22:15:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 3.044642857142857) internal successors, (682), 224 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 682 transitions. [2021-06-05 22:15:54,801 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 682 transitions. Word has length 19 [2021-06-05 22:15:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:54,801 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 682 transitions. [2021-06-05 22:15:54,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 682 transitions. [2021-06-05 22:15:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:54,801 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:54,801 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:55,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 190 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable716 [2021-06-05 22:15:55,017 INFO L430 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1412011018, now seen corresponding path program 75 times [2021-06-05 22:15:55,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:55,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957014455] [2021-06-05 22:15:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:55,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:55,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957014455] [2021-06-05 22:15:55,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957014455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:55,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58949319] [2021-06-05 22:15:55,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:55,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:15:55,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:55,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:55,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:55,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58949319] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:55,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:55,128 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:55,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53052103] [2021-06-05 22:15:55,128 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:55,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:55,128 INFO L87 Difference]: Start difference. First operand 225 states and 682 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:55,216 INFO L93 Difference]: Finished difference Result 458 states and 1317 transitions. [2021-06-05 22:15:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:55,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:55,217 INFO L225 Difference]: With dead ends: 458 [2021-06-05 22:15:55,217 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 22:15:55,217 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 22:15:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 216. [2021-06-05 22:15:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.0325581395348835) internal successors, (652), 215 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 652 transitions. [2021-06-05 22:15:55,220 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 652 transitions. Word has length 19 [2021-06-05 22:15:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:55,220 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 652 transitions. [2021-06-05 22:15:55,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 652 transitions. [2021-06-05 22:15:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:55,220 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:55,220 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:55,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:55,421 INFO L430 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1330770346, now seen corresponding path program 76 times [2021-06-05 22:15:55,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:55,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715374236] [2021-06-05 22:15:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:55,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:55,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715374236] [2021-06-05 22:15:55,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715374236] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:55,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544717852] [2021-06-05 22:15:55,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:55,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:55,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:55,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:55,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544717852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:55,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:55,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:55,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270281118] [2021-06-05 22:15:55,544 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:55,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:55,545 INFO L87 Difference]: Start difference. First operand 216 states and 652 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:55,670 INFO L93 Difference]: Finished difference Result 413 states and 1189 transitions. [2021-06-05 22:15:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:55,671 INFO L225 Difference]: With dead ends: 413 [2021-06-05 22:15:55,671 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:15:55,671 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 73.5ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 22:15:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:15:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 216. [2021-06-05 22:15:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 3.013953488372093) internal successors, (648), 215 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2021-06-05 22:15:55,675 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2021-06-05 22:15:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:55,675 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2021-06-05 22:15:55,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2021-06-05 22:15:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:55,675 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:55,676 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:55,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:55,889 INFO L430 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash -644891147, now seen corresponding path program 76 times [2021-06-05 22:15:55,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:55,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043193643] [2021-06-05 22:15:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:55,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:55,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043193643] [2021-06-05 22:15:55,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043193643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:55,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639793650] [2021-06-05 22:15:55,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:55,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:55,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:55,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:55,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639793650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:56,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:56,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:56,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666586967] [2021-06-05 22:15:56,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:56,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:56,017 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,129 INFO L93 Difference]: Finished difference Result 411 states and 1188 transitions. [2021-06-05 22:15:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,130 INFO L225 Difference]: With dead ends: 411 [2021-06-05 22:15:56,130 INFO L226 Difference]: Without dead ends: 411 [2021-06-05 22:15:56,130 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-06-05 22:15:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 212. [2021-06-05 22:15:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.014218009478673) internal successors, (636), 211 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 636 transitions. [2021-06-05 22:15:56,133 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 636 transitions. Word has length 19 [2021-06-05 22:15:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,133 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 636 transitions. [2021-06-05 22:15:56,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 636 transitions. [2021-06-05 22:15:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,133 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,133 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable723 [2021-06-05 22:15:56,334 INFO L430 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1954614186, now seen corresponding path program 77 times [2021-06-05 22:15:56,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869134878] [2021-06-05 22:15:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869134878] [2021-06-05 22:15:56,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869134878] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956653705] [2021-06-05 22:15:56,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,361 INFO L87 Difference]: Start difference. First operand 212 states and 636 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,435 INFO L93 Difference]: Finished difference Result 384 states and 1100 transitions. [2021-06-05 22:15:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,436 INFO L225 Difference]: With dead ends: 384 [2021-06-05 22:15:56,436 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 22:15:56,436 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 22:15:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 222. [2021-06-05 22:15:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.990950226244344) internal successors, (661), 221 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 661 transitions. [2021-06-05 22:15:56,438 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 661 transitions. Word has length 19 [2021-06-05 22:15:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,438 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 661 transitions. [2021-06-05 22:15:56,438 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 661 transitions. [2021-06-05 22:15:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,439 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,439 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2021-06-05 22:15:56,439 INFO L430 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash 852700034, now seen corresponding path program 78 times [2021-06-05 22:15:56,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283888965] [2021-06-05 22:15:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,469 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,469 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283888965] [2021-06-05 22:15:56,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283888965] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176149770] [2021-06-05 22:15:56,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,470 INFO L87 Difference]: Start difference. First operand 222 states and 661 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,544 INFO L93 Difference]: Finished difference Result 348 states and 1017 transitions. [2021-06-05 22:15:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,545 INFO L225 Difference]: With dead ends: 348 [2021-06-05 22:15:56,545 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 22:15:56,545 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 22:15:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 212. [2021-06-05 22:15:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.009478672985782) internal successors, (635), 211 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2021-06-05 22:15:56,548 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2021-06-05 22:15:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,548 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2021-06-05 22:15:56,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2021-06-05 22:15:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,548 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,548 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2021-06-05 22:15:56,548 INFO L430 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1616340899, now seen corresponding path program 77 times [2021-06-05 22:15:56,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051770918] [2021-06-05 22:15:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051770918] [2021-06-05 22:15:56,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051770918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532083084] [2021-06-05 22:15:56,579 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,580 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,661 INFO L93 Difference]: Finished difference Result 362 states and 1032 transitions. [2021-06-05 22:15:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,662 INFO L225 Difference]: With dead ends: 362 [2021-06-05 22:15:56,662 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 22:15:56,662 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 22:15:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2021-06-05 22:15:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.9907834101382487) internal successors, (649), 217 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 649 transitions. [2021-06-05 22:15:56,665 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 649 transitions. Word has length 19 [2021-06-05 22:15:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,665 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 649 transitions. [2021-06-05 22:15:56,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 649 transitions. [2021-06-05 22:15:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,665 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,665 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2021-06-05 22:15:56,665 INFO L430 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1345831207, now seen corresponding path program 78 times [2021-06-05 22:15:56,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129614198] [2021-06-05 22:15:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129614198] [2021-06-05 22:15:56,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129614198] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802284135] [2021-06-05 22:15:56,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,699 INFO L87 Difference]: Start difference. First operand 218 states and 649 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,783 INFO L93 Difference]: Finished difference Result 340 states and 995 transitions. [2021-06-05 22:15:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,783 INFO L225 Difference]: With dead ends: 340 [2021-06-05 22:15:56,783 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 22:15:56,784 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 22:15:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 195. [2021-06-05 22:15:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.984536082474227) internal successors, (579), 194 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 579 transitions. [2021-06-05 22:15:56,786 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 579 transitions. Word has length 19 [2021-06-05 22:15:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,786 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 579 transitions. [2021-06-05 22:15:56,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 579 transitions. [2021-06-05 22:15:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,786 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,786 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2021-06-05 22:15:56,786 INFO L430 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -494336067, now seen corresponding path program 79 times [2021-06-05 22:15:56,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506402819] [2021-06-05 22:15:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506402819] [2021-06-05 22:15:56,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506402819] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252330103] [2021-06-05 22:15:56,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,819 INFO L87 Difference]: Start difference. First operand 195 states and 579 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,890 INFO L93 Difference]: Finished difference Result 335 states and 937 transitions. [2021-06-05 22:15:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,890 INFO L225 Difference]: With dead ends: 335 [2021-06-05 22:15:56,890 INFO L226 Difference]: Without dead ends: 327 [2021-06-05 22:15:56,891 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-06-05 22:15:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2021-06-05 22:15:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.9668246445497632) internal successors, (626), 211 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 626 transitions. [2021-06-05 22:15:56,893 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 626 transitions. Word has length 19 [2021-06-05 22:15:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:56,893 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 626 transitions. [2021-06-05 22:15:56,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 626 transitions. [2021-06-05 22:15:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:56,893 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:56,894 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:56,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2021-06-05 22:15:56,894 INFO L430 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -113598427, now seen corresponding path program 80 times [2021-06-05 22:15:56,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:56,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469319831] [2021-06-05 22:15:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:56,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:56,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469319831] [2021-06-05 22:15:56,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469319831] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:56,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:56,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:56,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331031371] [2021-06-05 22:15:56,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:56,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:56,924 INFO L87 Difference]: Start difference. First operand 212 states and 626 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:56,997 INFO L93 Difference]: Finished difference Result 333 states and 932 transitions. [2021-06-05 22:15:56,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:56,997 INFO L225 Difference]: With dead ends: 333 [2021-06-05 22:15:56,998 INFO L226 Difference]: Without dead ends: 325 [2021-06-05 22:15:56,998 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-06-05 22:15:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2021-06-05 22:15:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.9617224880382773) internal successors, (619), 209 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 619 transitions. [2021-06-05 22:15:57,000 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 619 transitions. Word has length 19 [2021-06-05 22:15:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:57,000 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 619 transitions. [2021-06-05 22:15:57,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 619 transitions. [2021-06-05 22:15:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:57,000 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:57,001 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:57,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2021-06-05 22:15:57,001 INFO L430 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 483738231, now seen corresponding path program 81 times [2021-06-05 22:15:57,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:57,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361687310] [2021-06-05 22:15:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:57,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361687310] [2021-06-05 22:15:57,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361687310] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:57,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:57,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:57,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184930252] [2021-06-05 22:15:57,027 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:57,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:57,027 INFO L87 Difference]: Start difference. First operand 210 states and 619 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:57,093 INFO L93 Difference]: Finished difference Result 347 states and 973 transitions. [2021-06-05 22:15:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:57,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:57,094 INFO L225 Difference]: With dead ends: 347 [2021-06-05 22:15:57,094 INFO L226 Difference]: Without dead ends: 333 [2021-06-05 22:15:57,094 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-06-05 22:15:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 208. [2021-06-05 22:15:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9613526570048307) internal successors, (613), 207 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 22:15:57,097 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 22:15:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:57,097 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 22:15:57,097 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 22:15:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:57,097 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:57,097 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:57,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2021-06-05 22:15:57,097 INFO L430 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:57,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1339481934, now seen corresponding path program 79 times [2021-06-05 22:15:57,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:57,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645475676] [2021-06-05 22:15:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:57,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645475676] [2021-06-05 22:15:57,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645475676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:57,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498882352] [2021-06-05 22:15:57,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:57,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:57,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498882352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:57,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:57,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:57,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292652276] [2021-06-05 22:15:57,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:57,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:57,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:57,231 INFO L87 Difference]: Start difference. First operand 208 states and 613 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:57,335 INFO L93 Difference]: Finished difference Result 388 states and 1116 transitions. [2021-06-05 22:15:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:57,335 INFO L225 Difference]: With dead ends: 388 [2021-06-05 22:15:57,336 INFO L226 Difference]: Without dead ends: 388 [2021-06-05 22:15:57,336 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-06-05 22:15:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 214. [2021-06-05 22:15:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.9906103286384975) internal successors, (637), 213 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 637 transitions. [2021-06-05 22:15:57,338 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 637 transitions. Word has length 19 [2021-06-05 22:15:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:57,338 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 637 transitions. [2021-06-05 22:15:57,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 637 transitions. [2021-06-05 22:15:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:57,339 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:57,339 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:57,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731,194 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:57,539 INFO L430 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2025324186, now seen corresponding path program 80 times [2021-06-05 22:15:57,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:57,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475530521] [2021-06-05 22:15:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:57,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475530521] [2021-06-05 22:15:57,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475530521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:57,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750862623] [2021-06-05 22:15:57,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:57,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:57,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:57,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:57,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750862623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:57,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:57,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:57,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117943003] [2021-06-05 22:15:57,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:57,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:57,660 INFO L87 Difference]: Start difference. First operand 214 states and 637 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:57,744 INFO L93 Difference]: Finished difference Result 382 states and 1089 transitions. [2021-06-05 22:15:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:57,744 INFO L225 Difference]: With dead ends: 382 [2021-06-05 22:15:57,744 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 22:15:57,744 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 22:15:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 22:15:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 211. [2021-06-05 22:15:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.9761904761904763) internal successors, (625), 210 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 625 transitions. [2021-06-05 22:15:57,747 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 625 transitions. Word has length 19 [2021-06-05 22:15:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:57,747 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 625 transitions. [2021-06-05 22:15:57,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 625 transitions. [2021-06-05 22:15:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:57,747 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:57,747 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:57,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable732 [2021-06-05 22:15:57,948 INFO L430 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1256950578, now seen corresponding path program 81 times [2021-06-05 22:15:57,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:57,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745305223] [2021-06-05 22:15:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:57,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:57,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745305223] [2021-06-05 22:15:57,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745305223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:57,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567199464] [2021-06-05 22:15:57,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:58,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:15:58,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:58,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:58,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:58,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567199464] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:58,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:58,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 22:15:58,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263368123] [2021-06-05 22:15:58,054 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 22:15:58,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:58,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 22:15:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:58,054 INFO L87 Difference]: Start difference. First operand 211 states and 625 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:58,144 INFO L93 Difference]: Finished difference Result 370 states and 1047 transitions. [2021-06-05 22:15:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:58,145 INFO L225 Difference]: With dead ends: 370 [2021-06-05 22:15:58,145 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 22:15:58,145 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 22:15:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 208. [2021-06-05 22:15:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9613526570048307) internal successors, (613), 207 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 22:15:58,148 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 22:15:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:58,148 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 22:15:58,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 22:15:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:58,148 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:58,148 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:58,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735,196 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:58,349 INFO L430 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1258244423, now seen corresponding path program 82 times [2021-06-05 22:15:58,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:58,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951143550] [2021-06-05 22:15:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:58,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:58,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951143550] [2021-06-05 22:15:58,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951143550] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:58,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:58,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:58,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240970114] [2021-06-05 22:15:58,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:58,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:58,379 INFO L87 Difference]: Start difference. First operand 208 states and 613 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:58,452 INFO L93 Difference]: Finished difference Result 371 states and 1007 transitions. [2021-06-05 22:15:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:58,453 INFO L225 Difference]: With dead ends: 371 [2021-06-05 22:15:58,453 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 22:15:58,453 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 22:15:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 218. [2021-06-05 22:15:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.986175115207373) internal successors, (648), 217 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 648 transitions. [2021-06-05 22:15:58,456 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 648 transitions. Word has length 19 [2021-06-05 22:15:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:58,456 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 648 transitions. [2021-06-05 22:15:58,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 648 transitions. [2021-06-05 22:15:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:58,456 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:58,456 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:58,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2021-06-05 22:15:58,457 INFO L430 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -877506783, now seen corresponding path program 83 times [2021-06-05 22:15:58,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:58,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299851778] [2021-06-05 22:15:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:58,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:58,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299851778] [2021-06-05 22:15:58,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299851778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:15:58,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:15:58,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:15:58,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050020280] [2021-06-05 22:15:58,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:15:58,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:15:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:15:58,497 INFO L87 Difference]: Start difference. First operand 218 states and 648 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:58,577 INFO L93 Difference]: Finished difference Result 377 states and 1022 transitions. [2021-06-05 22:15:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:58,578 INFO L225 Difference]: With dead ends: 377 [2021-06-05 22:15:58,578 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 22:15:58,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:15:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 22:15:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 220. [2021-06-05 22:15:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.9771689497716896) internal successors, (652), 219 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2021-06-05 22:15:58,581 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2021-06-05 22:15:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:58,581 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2021-06-05 22:15:58,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2021-06-05 22:15:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:58,581 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:58,581 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:58,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2021-06-05 22:15:58,581 INFO L430 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash 674118506, now seen corresponding path program 82 times [2021-06-05 22:15:58,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:58,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861371985] [2021-06-05 22:15:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:58,615 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:58,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861371985] [2021-06-05 22:15:58,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861371985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:58,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42217108] [2021-06-05 22:15:58,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:58,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:15:58,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:58,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:58,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:58,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42217108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:58,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:58,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:58,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178828541] [2021-06-05 22:15:58,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:58,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:58,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:58,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:58,707 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:58,809 INFO L93 Difference]: Finished difference Result 433 states and 1227 transitions. [2021-06-05 22:15:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:58,810 INFO L225 Difference]: With dead ends: 433 [2021-06-05 22:15:58,810 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 22:15:58,810 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 22:15:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 226. [2021-06-05 22:15:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 3.017777777777778) internal successors, (679), 225 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2021-06-05 22:15:58,813 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2021-06-05 22:15:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:58,813 INFO L482 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2021-06-05 22:15:58,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2021-06-05 22:15:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:58,813 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:58,813 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:59,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable740 [2021-06-05 22:15:59,014 INFO L430 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1604279682, now seen corresponding path program 83 times [2021-06-05 22:15:59,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:59,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110967874] [2021-06-05 22:15:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:59,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110967874] [2021-06-05 22:15:59,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110967874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22006527] [2021-06-05 22:15:59,058 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:59,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:15:59,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:59,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:59,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22006527] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:59,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:59,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354494935] [2021-06-05 22:15:59,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:59,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:59,161 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:59,245 INFO L93 Difference]: Finished difference Result 415 states and 1158 transitions. [2021-06-05 22:15:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:59,246 INFO L225 Difference]: With dead ends: 415 [2021-06-05 22:15:59,246 INFO L226 Difference]: Without dead ends: 409 [2021-06-05 22:15:59,246 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-06-05 22:15:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 225. [2021-06-05 22:15:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 3.0089285714285716) internal successors, (674), 224 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 674 transitions. [2021-06-05 22:15:59,249 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 674 transitions. Word has length 19 [2021-06-05 22:15:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:59,249 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 674 transitions. [2021-06-05 22:15:59,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 674 transitions. [2021-06-05 22:15:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:59,249 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:59,249 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:59,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable741 [2021-06-05 22:15:59,450 INFO L430 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1462378563, now seen corresponding path program 84 times [2021-06-05 22:15:59,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:59,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579514846] [2021-06-05 22:15:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:59,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579514846] [2021-06-05 22:15:59,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579514846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262837382] [2021-06-05 22:15:59,480 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:59,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:15:59,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:59,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:59,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262837382] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:59,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:59,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946987967] [2021-06-05 22:15:59,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:59,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:59,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:59,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:59,569 INFO L87 Difference]: Start difference. First operand 225 states and 674 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:15:59,654 INFO L93 Difference]: Finished difference Result 343 states and 948 transitions. [2021-06-05 22:15:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:15:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:15:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:15:59,655 INFO L225 Difference]: With dead ends: 343 [2021-06-05 22:15:59,655 INFO L226 Difference]: Without dead ends: 335 [2021-06-05 22:15:59,655 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:15:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-06-05 22:15:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 222. [2021-06-05 22:15:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 3.0) internal successors, (663), 221 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 663 transitions. [2021-06-05 22:15:59,657 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 663 transitions. Word has length 19 [2021-06-05 22:15:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:15:59,657 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 663 transitions. [2021-06-05 22:15:59,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:15:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 663 transitions. [2021-06-05 22:15:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:15:59,658 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:15:59,658 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:15:59,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:59,858 INFO L430 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:15:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:15:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 874518162, now seen corresponding path program 84 times [2021-06-05 22:15:59,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:15:59,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180145589] [2021-06-05 22:15:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:15:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:15:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:15:59,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180145589] [2021-06-05 22:15:59,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180145589] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241078963] [2021-06-05 22:15:59,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:15:59,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:15:59,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:15:59,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:15:59,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:15:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:15:59,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241078963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:15:59,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:15:59,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:15:59,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098351648] [2021-06-05 22:15:59,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:15:59,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:15:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:15:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:15:59,997 INFO L87 Difference]: Start difference. First operand 222 states and 663 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:00,089 INFO L93 Difference]: Finished difference Result 360 states and 1019 transitions. [2021-06-05 22:16:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:00,090 INFO L225 Difference]: With dead ends: 360 [2021-06-05 22:16:00,090 INFO L226 Difference]: Without dead ends: 360 [2021-06-05 22:16:00,090 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:16:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-06-05 22:16:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 213. [2021-06-05 22:16:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.9858490566037736) internal successors, (633), 212 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 633 transitions. [2021-06-05 22:16:00,093 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 633 transitions. Word has length 19 [2021-06-05 22:16:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:00,093 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 633 transitions. [2021-06-05 22:16:00,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 633 transitions. [2021-06-05 22:16:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:00,093 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:00,094 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:00,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable747 [2021-06-05 22:16:00,294 INFO L430 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:00,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash 793277490, now seen corresponding path program 85 times [2021-06-05 22:16:00,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:00,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253165539] [2021-06-05 22:16:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:00,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:00,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253165539] [2021-06-05 22:16:00,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253165539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:00,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955495392] [2021-06-05 22:16:00,324 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:16:00,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:00,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955495392] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:00,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:00,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:16:00,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594032306] [2021-06-05 22:16:00,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:16:00,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:16:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:00,412 INFO L87 Difference]: Start difference. First operand 213 states and 633 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:00,493 INFO L93 Difference]: Finished difference Result 315 states and 891 transitions. [2021-06-05 22:16:00,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:00,494 INFO L225 Difference]: With dead ends: 315 [2021-06-05 22:16:00,494 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 22:16:00,494 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.4ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:16:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 22:16:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 213. [2021-06-05 22:16:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.9669811320754715) internal successors, (629), 212 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 629 transitions. [2021-06-05 22:16:00,497 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 629 transitions. Word has length 19 [2021-06-05 22:16:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:00,497 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 629 transitions. [2021-06-05 22:16:00,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 629 transitions. [2021-06-05 22:16:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:00,497 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:00,497 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:00,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748,201 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:00,698 INFO L430 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1182384003, now seen corresponding path program 85 times [2021-06-05 22:16:00,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:00,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995079242] [2021-06-05 22:16:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:00,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:00,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995079242] [2021-06-05 22:16:00,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995079242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:00,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161200352] [2021-06-05 22:16:00,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:00,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 22:16:00,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:00,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161200352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:00,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:00,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 22:16:00,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390694072] [2021-06-05 22:16:00,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 22:16:00,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 22:16:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:00,823 INFO L87 Difference]: Start difference. First operand 213 states and 629 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:00,912 INFO L93 Difference]: Finished difference Result 302 states and 860 transitions. [2021-06-05 22:16:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:00,912 INFO L225 Difference]: With dead ends: 302 [2021-06-05 22:16:00,912 INFO L226 Difference]: Without dead ends: 302 [2021-06-05 22:16:00,912 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 22:16:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-06-05 22:16:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 209. [2021-06-05 22:16:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.9663461538461537) internal successors, (617), 208 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 617 transitions. [2021-06-05 22:16:00,915 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 617 transitions. Word has length 19 [2021-06-05 22:16:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:00,915 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 617 transitions. [2021-06-05 22:16:00,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 617 transitions. [2021-06-05 22:16:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:00,915 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:00,915 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable751 [2021-06-05 22:16:01,116 INFO L430 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1417121330, now seen corresponding path program 86 times [2021-06-05 22:16:01,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572646993] [2021-06-05 22:16:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572646993] [2021-06-05 22:16:01,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572646993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463985715] [2021-06-05 22:16:01,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,145 INFO L87 Difference]: Start difference. First operand 209 states and 617 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,273 INFO L93 Difference]: Finished difference Result 353 states and 973 transitions. [2021-06-05 22:16:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,274 INFO L225 Difference]: With dead ends: 353 [2021-06-05 22:16:01,274 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 22:16:01,274 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 22:16:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2021-06-05 22:16:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.944954128440367) internal successors, (642), 218 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 642 transitions. [2021-06-05 22:16:01,277 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 642 transitions. Word has length 19 [2021-06-05 22:16:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,277 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 642 transitions. [2021-06-05 22:16:01,277 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 642 transitions. [2021-06-05 22:16:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,277 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,277 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2021-06-05 22:16:01,277 INFO L430 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash 315207178, now seen corresponding path program 87 times [2021-06-05 22:16:01,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317821213] [2021-06-05 22:16:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317821213] [2021-06-05 22:16:01,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317821213] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709243410] [2021-06-05 22:16:01,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,308 INFO L87 Difference]: Start difference. First operand 219 states and 642 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,405 INFO L93 Difference]: Finished difference Result 317 states and 890 transitions. [2021-06-05 22:16:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,407 INFO L225 Difference]: With dead ends: 317 [2021-06-05 22:16:01,407 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 22:16:01,407 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 22:16:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 209. [2021-06-05 22:16:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.9615384615384617) internal successors, (616), 208 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2021-06-05 22:16:01,411 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2021-06-05 22:16:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,411 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2021-06-05 22:16:01,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2021-06-05 22:16:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,411 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,411 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2021-06-05 22:16:01,411 INFO L430 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2141133541, now seen corresponding path program 86 times [2021-06-05 22:16:01,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545599528] [2021-06-05 22:16:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545599528] [2021-06-05 22:16:01,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545599528] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298563123] [2021-06-05 22:16:01,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,443 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,524 INFO L93 Difference]: Finished difference Result 353 states and 981 transitions. [2021-06-05 22:16:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,525 INFO L225 Difference]: With dead ends: 353 [2021-06-05 22:16:01,525 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 22:16:01,525 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:16:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 22:16:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 221. [2021-06-05 22:16:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.9681818181818183) internal successors, (653), 220 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 653 transitions. [2021-06-05 22:16:01,528 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 653 transitions. Word has length 19 [2021-06-05 22:16:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,528 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 653 transitions. [2021-06-05 22:16:01,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 653 transitions. [2021-06-05 22:16:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,528 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,528 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2021-06-05 22:16:01,529 INFO L430 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1883324063, now seen corresponding path program 87 times [2021-06-05 22:16:01,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520856213] [2021-06-05 22:16:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520856213] [2021-06-05 22:16:01,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520856213] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930195215] [2021-06-05 22:16:01,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,563 INFO L87 Difference]: Start difference. First operand 221 states and 653 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,650 INFO L93 Difference]: Finished difference Result 331 states and 944 transitions. [2021-06-05 22:16:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,650 INFO L225 Difference]: With dead ends: 331 [2021-06-05 22:16:01,650 INFO L226 Difference]: Without dead ends: 331 [2021-06-05 22:16:01,650 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:16:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-06-05 22:16:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 208. [2021-06-05 22:16:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9613526570048307) internal successors, (613), 207 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 22:16:01,653 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 22:16:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,653 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 22:16:01,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 22:16:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,653 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,653 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2021-06-05 22:16:01,653 INFO L430 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash -249991038, now seen corresponding path program 88 times [2021-06-05 22:16:01,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785409910] [2021-06-05 22:16:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785409910] [2021-06-05 22:16:01,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785409910] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611437039] [2021-06-05 22:16:01,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,679 INFO L87 Difference]: Start difference. First operand 208 states and 613 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,774 INFO L93 Difference]: Finished difference Result 292 states and 822 transitions. [2021-06-05 22:16:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,775 INFO L225 Difference]: With dead ends: 292 [2021-06-05 22:16:01,775 INFO L226 Difference]: Without dead ends: 280 [2021-06-05 22:16:01,775 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-06-05 22:16:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 210. [2021-06-05 22:16:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.9473684210526314) internal successors, (616), 209 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 616 transitions. [2021-06-05 22:16:01,777 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 616 transitions. Word has length 19 [2021-06-05 22:16:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,778 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 616 transitions. [2021-06-05 22:16:01,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 616 transitions. [2021-06-05 22:16:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,778 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,778 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,778 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2021-06-05 22:16:01,778 INFO L430 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash 144187622, now seen corresponding path program 89 times [2021-06-05 22:16:01,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780107111] [2021-06-05 22:16:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780107111] [2021-06-05 22:16:01,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780107111] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429361484] [2021-06-05 22:16:01,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,806 INFO L87 Difference]: Start difference. First operand 210 states and 616 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:01,913 INFO L93 Difference]: Finished difference Result 280 states and 784 transitions. [2021-06-05 22:16:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:01,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:01,914 INFO L225 Difference]: With dead ends: 280 [2021-06-05 22:16:01,914 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 22:16:01,914 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 22:16:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2021-06-05 22:16:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.9269406392694064) internal successors, (641), 219 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 641 transitions. [2021-06-05 22:16:01,916 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 641 transitions. Word has length 19 [2021-06-05 22:16:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:01,916 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 641 transitions. [2021-06-05 22:16:01,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 641 transitions. [2021-06-05 22:16:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:01,917 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:01,917 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:01,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2021-06-05 22:16:01,917 INFO L430 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash -957726530, now seen corresponding path program 90 times [2021-06-05 22:16:01,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:01,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843742608] [2021-06-05 22:16:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:01,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:01,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843742608] [2021-06-05 22:16:01,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843742608] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:01,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:01,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:01,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835327462] [2021-06-05 22:16:01,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:01,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:01,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:01,949 INFO L87 Difference]: Start difference. First operand 220 states and 641 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:02,043 INFO L93 Difference]: Finished difference Result 244 states and 701 transitions. [2021-06-05 22:16:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:02,043 INFO L225 Difference]: With dead ends: 244 [2021-06-05 22:16:02,043 INFO L226 Difference]: Without dead ends: 231 [2021-06-05 22:16:02,044 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 22:16:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-06-05 22:16:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 208. [2021-06-05 22:16:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9565217391304346) internal successors, (612), 207 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 612 transitions. [2021-06-05 22:16:02,046 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 612 transitions. Word has length 19 [2021-06-05 22:16:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:02,046 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 612 transitions. [2021-06-05 22:16:02,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 612 transitions. [2021-06-05 22:16:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:02,046 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:02,046 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:02,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2021-06-05 22:16:02,046 INFO L430 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -427692237, now seen corresponding path program 88 times [2021-06-05 22:16:02,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:02,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006282689] [2021-06-05 22:16:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:02,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:02,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006282689] [2021-06-05 22:16:02,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006282689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:02,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:02,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:02,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712832430] [2021-06-05 22:16:02,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:02,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:02,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:02,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:02,073 INFO L87 Difference]: Start difference. First operand 208 states and 612 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:02,131 INFO L93 Difference]: Finished difference Result 277 states and 780 transitions. [2021-06-05 22:16:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:02,132 INFO L225 Difference]: With dead ends: 277 [2021-06-05 22:16:02,132 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 22:16:02,132 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:16:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 22:16:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 208. [2021-06-05 22:16:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9516908212560384) internal successors, (611), 207 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 611 transitions. [2021-06-05 22:16:02,134 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 611 transitions. Word has length 19 [2021-06-05 22:16:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:02,134 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 611 transitions. [2021-06-05 22:16:02,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 611 transitions. [2021-06-05 22:16:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:02,135 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:02,135 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:02,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2021-06-05 22:16:02,135 INFO L430 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 656044215, now seen corresponding path program 89 times [2021-06-05 22:16:02,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:02,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790305047] [2021-06-05 22:16:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:02,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:02,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790305047] [2021-06-05 22:16:02,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790305047] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:02,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:02,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:02,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587149775] [2021-06-05 22:16:02,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:02,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:02,165 INFO L87 Difference]: Start difference. First operand 208 states and 611 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:02,239 INFO L93 Difference]: Finished difference Result 281 states and 792 transitions. [2021-06-05 22:16:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:02,240 INFO L225 Difference]: With dead ends: 281 [2021-06-05 22:16:02,240 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 22:16:02,240 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:16:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 22:16:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 214. [2021-06-05 22:16:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.9342723004694835) internal successors, (625), 213 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 625 transitions. [2021-06-05 22:16:02,243 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 625 transitions. Word has length 19 [2021-06-05 22:16:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:02,243 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 625 transitions. [2021-06-05 22:16:02,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 625 transitions. [2021-06-05 22:16:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 22:16:02,243 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:02,244 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:02,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2021-06-05 22:16:02,244 INFO L430 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 926553907, now seen corresponding path program 90 times [2021-06-05 22:16:02,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:02,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315045391] [2021-06-05 22:16:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:02,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:02,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315045391] [2021-06-05 22:16:02,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315045391] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 22:16:02,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 22:16:02,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 22:16:02,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476004433] [2021-06-05 22:16:02,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 22:16:02,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 22:16:02,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 22:16:02,278 INFO L87 Difference]: Start difference. First operand 214 states and 625 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:02,351 INFO L93 Difference]: Finished difference Result 246 states and 717 transitions. [2021-06-05 22:16:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 22:16:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 22:16:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:02,351 INFO L225 Difference]: With dead ends: 246 [2021-06-05 22:16:02,351 INFO L226 Difference]: Without dead ends: 246 [2021-06-05 22:16:02,352 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 22:16:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-06-05 22:16:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2021-06-05 22:16:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.9202127659574466) internal successors, (549), 188 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 549 transitions. [2021-06-05 22:16:02,354 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 549 transitions. Word has length 19 [2021-06-05 22:16:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:02,354 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 549 transitions. [2021-06-05 22:16:02,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 549 transitions. [2021-06-05 22:16:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:02,354 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:02,354 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:02,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2021-06-05 22:16:02,354 INFO L430 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash 440404552, now seen corresponding path program 1 times [2021-06-05 22:16:02,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:02,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534135626] [2021-06-05 22:16:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:02,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:02,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534135626] [2021-06-05 22:16:02,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534135626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:02,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509351076] [2021-06-05 22:16:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:02,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:02,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:03,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:03,370 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,666 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 22:16:03,669 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 22:16:03,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:03,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:03,702 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,819 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:16:03,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:03,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:03,826 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:03,845 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:03,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:03,950 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:03,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:03,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:03,958 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:04,073 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 22:16:04,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:04,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:04,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:04,080 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:04,188 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:16:04,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:04,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:04,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:04,195 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:04,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:04,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:04,304 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 22:16:04,502 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:16:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:05,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509351076] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:05,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:05,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:05,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156900663] [2021-06-05 22:16:05,279 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:05,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:05,280 INFO L87 Difference]: Start difference. First operand 189 states and 549 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:05,992 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2021-06-05 22:16:06,454 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2021-06-05 22:16:06,652 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-06-05 22:16:07,089 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2021-06-05 22:16:07,329 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2021-06-05 22:16:07,765 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 130 [2021-06-05 22:16:07,980 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-06-05 22:16:08,471 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 137 [2021-06-05 22:16:08,739 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2021-06-05 22:16:09,075 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2021-06-05 22:16:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:09,122 INFO L93 Difference]: Finished difference Result 525 states and 1421 transitions. [2021-06-05 22:16:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 22:16:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:09,123 INFO L225 Difference]: With dead ends: 525 [2021-06-05 22:16:09,123 INFO L226 Difference]: Without dead ends: 495 [2021-06-05 22:16:09,123 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4579.7ms TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 22:16:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-06-05 22:16:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 217. [2021-06-05 22:16:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.861111111111111) internal successors, (618), 216 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 618 transitions. [2021-06-05 22:16:09,126 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 618 transitions. Word has length 20 [2021-06-05 22:16:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:09,127 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 618 transitions. [2021-06-05 22:16:09,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 618 transitions. [2021-06-05 22:16:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:09,127 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:09,127 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:09,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 203 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable762 [2021-06-05 22:16:09,327 INFO L430 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash 43486898, now seen corresponding path program 2 times [2021-06-05 22:16:09,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:09,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361964486] [2021-06-05 22:16:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:09,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:09,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361964486] [2021-06-05 22:16:09,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361964486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:09,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314600380] [2021-06-05 22:16:09,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:09,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:16:09,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:09,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:10,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:10,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,601 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 22:16:10,601 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 22:16:10,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:10,608 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,713 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:16:10,713 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:10,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:10,720 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:10,725 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,827 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:16:10,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:10,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:10,835 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:10,841 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:10,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:10,937 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:10,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:10,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:10,942 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:11,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:11,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:11,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:11,026 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:11,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:11,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:11,111 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 22:16:11,294 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:16:11,489 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:16:11,968 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:16:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:12,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314600380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:12,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:12,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:12,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796046948] [2021-06-05 22:16:12,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:12,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:12,203 INFO L87 Difference]: Start difference. First operand 217 states and 618 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:12,521 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 22:16:12,787 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-06-05 22:16:13,180 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2021-06-05 22:16:13,709 WARN L205 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 135 [2021-06-05 22:16:14,409 WARN L205 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 145 [2021-06-05 22:16:15,187 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 153 [2021-06-05 22:16:16,086 WARN L205 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 162 [2021-06-05 22:16:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:16,112 INFO L93 Difference]: Finished difference Result 491 states and 1336 transitions. [2021-06-05 22:16:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:16:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:16,113 INFO L225 Difference]: With dead ends: 491 [2021-06-05 22:16:16,113 INFO L226 Difference]: Without dead ends: 476 [2021-06-05 22:16:16,113 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4853.7ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:16:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-06-05 22:16:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 243. [2021-06-05 22:16:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.896694214876033) internal successors, (701), 242 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 701 transitions. [2021-06-05 22:16:16,117 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 701 transitions. Word has length 20 [2021-06-05 22:16:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:16,117 INFO L482 AbstractCegarLoop]: Abstraction has 243 states and 701 transitions. [2021-06-05 22:16:16,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 701 transitions. [2021-06-05 22:16:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:16,117 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:16,117 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:16,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable822 [2021-06-05 22:16:16,318 INFO L430 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1655233490, now seen corresponding path program 3 times [2021-06-05 22:16:16,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:16,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191786096] [2021-06-05 22:16:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:16,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:16,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191786096] [2021-06-05 22:16:16,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191786096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:16,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197820453] [2021-06-05 22:16:16,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:16,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:16:16,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:16,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:16,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:17,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:17,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:16:17,177 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:16:17,185 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:17,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:17,200 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:17,207 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,432 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 22:16:17,433 INFO L628 ElimStorePlain]: treesize reduction 304, result has 46.9 percent of original size [2021-06-05 22:16:17,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:17,439 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:17,444 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:17,449 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:17,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:17,544 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:17,550 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:17,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:17,563 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:17,732 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 22:16:17,733 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 22:16:17,739 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:17,739 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:757, output treesize:194 [2021-06-05 22:16:18,414 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:16:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:18,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197820453] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:18,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:18,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:18,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505004478] [2021-06-05 22:16:18,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:18,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:18,613 INFO L87 Difference]: Start difference. First operand 243 states and 701 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:18,851 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2021-06-05 22:16:19,061 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2021-06-05 22:16:19,432 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 125 [2021-06-05 22:16:19,925 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 130 [2021-06-05 22:16:20,609 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 137 [2021-06-05 22:16:21,381 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 142 [2021-06-05 22:16:22,209 WARN L205 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 149 [2021-06-05 22:16:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:22,235 INFO L93 Difference]: Finished difference Result 498 states and 1352 transitions. [2021-06-05 22:16:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:16:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:22,236 INFO L225 Difference]: With dead ends: 498 [2021-06-05 22:16:22,236 INFO L226 Difference]: Without dead ends: 483 [2021-06-05 22:16:22,236 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4301.8ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:16:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-06-05 22:16:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 243. [2021-06-05 22:16:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.896694214876033) internal successors, (701), 242 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 701 transitions. [2021-06-05 22:16:22,239 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 701 transitions. Word has length 20 [2021-06-05 22:16:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:22,239 INFO L482 AbstractCegarLoop]: Abstraction has 243 states and 701 transitions. [2021-06-05 22:16:22,239 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 701 transitions. [2021-06-05 22:16:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:22,239 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:22,239 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:22,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:22,453 INFO L430 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1828481182, now seen corresponding path program 4 times [2021-06-05 22:16:22,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:22,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527114600] [2021-06-05 22:16:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:22,827 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-06-05 22:16:23,011 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 22:16:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:23,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:23,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527114600] [2021-06-05 22:16:23,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527114600] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:23,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311916992] [2021-06-05 22:16:23,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:23,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:16:23,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:23,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:16:23,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:23,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:23,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:23,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,307 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2021-06-05 22:16:24,308 INFO L628 ElimStorePlain]: treesize reduction 174, result has 67.4 percent of original size [2021-06-05 22:16:24,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:24,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:24,321 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,452 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:16:24,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:24,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:24,458 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,588 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:16:24,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:24,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:24,595 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,721 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:16:24,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:24,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:24,730 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:24,736 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,865 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:16:24,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:24,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:24,873 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:24,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:24,878 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:24,989 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 22:16:24,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:24,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:24,996 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:541, output treesize:250 [2021-06-05 22:16:25,194 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2021-06-05 22:16:25,373 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:16:25,608 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2021-06-05 22:16:26,312 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_83, v_prenex_93, v_prenex_81, v_prenex_91, v_prenex_87, get_6, v_prenex_85, v_prenex_79, v_prenex_89, v_prenex_77], 1=[get_3, v_prenex_82, v_prenex_92, v_prenex_80, v_prenex_76, v_prenex_86, v_prenex_84, v_prenex_78, v_prenex_88, v_prenex_90]} [2021-06-05 22:16:26,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:26,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:26,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:26,339 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:26,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:26,353 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:26,708 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 80 [2021-06-05 22:16:26,708 INFO L628 ElimStorePlain]: treesize reduction 735, result has 28.3 percent of original size [2021-06-05 22:16:26,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:26,714 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:26,827 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 22:16:26,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:26,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:26,833 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:26,943 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:16:26,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:26,944 INFO L518 ElimStorePlain]: Eliminatee v_prenex_91 vanished before elimination [2021-06-05 22:16:26,944 INFO L518 ElimStorePlain]: Eliminatee v_prenex_87 vanished before elimination [2021-06-05 22:16:26,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:16:26,949 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:27,056 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-06-05 22:16:27,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:27,056 INFO L518 ElimStorePlain]: Eliminatee v_prenex_85 vanished before elimination [2021-06-05 22:16:27,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:27,061 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:27,165 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-06-05 22:16:27,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_89 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_77 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_82 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_92 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_80 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_76 vanished before elimination [2021-06-05 22:16:27,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_86 vanished before elimination [2021-06-05 22:16:27,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_84 vanished before elimination [2021-06-05 22:16:27,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_78 vanished before elimination [2021-06-05 22:16:27,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_88 vanished before elimination [2021-06-05 22:16:27,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_90 vanished before elimination [2021-06-05 22:16:27,169 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 20 dim-1 vars, End of recursive call: and 11 xjuncts. [2021-06-05 22:16:27,169 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 30 variables, input treesize:1109, output treesize:224 [2021-06-05 22:16:27,327 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2021-06-05 22:16:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:27,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311916992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:27,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:27,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:27,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48551626] [2021-06-05 22:16:27,455 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:27,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:27,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:27,455 INFO L87 Difference]: Start difference. First operand 243 states and 701 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:27,723 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2021-06-05 22:16:27,974 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2021-06-05 22:16:28,650 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 144 [2021-06-05 22:16:28,900 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 59 [2021-06-05 22:16:29,623 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 148 [2021-06-05 22:16:29,876 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 61 [2021-06-05 22:16:30,774 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 153 [2021-06-05 22:16:31,662 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 162 [2021-06-05 22:16:32,621 WARN L205 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 171 [2021-06-05 22:16:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:32,651 INFO L93 Difference]: Finished difference Result 534 states and 1461 transitions. [2021-06-05 22:16:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:16:32,651 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:32,652 INFO L225 Difference]: With dead ends: 534 [2021-06-05 22:16:32,652 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 22:16:32,652 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 6247.1ms TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:16:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 22:16:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 280. [2021-06-05 22:16:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 2.835125448028674) internal successors, (791), 279 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 791 transitions. [2021-06-05 22:16:32,655 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 791 transitions. Word has length 20 [2021-06-05 22:16:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:32,655 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 791 transitions. [2021-06-05 22:16:32,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 791 transitions. [2021-06-05 22:16:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:32,656 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:32,656 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:32,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 206 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable972 [2021-06-05 22:16:32,856 INFO L430 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash 123064008, now seen corresponding path program 5 times [2021-06-05 22:16:32,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:32,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818401498] [2021-06-05 22:16:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:33,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:33,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818401498] [2021-06-05 22:16:33,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818401498] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:33,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165207634] [2021-06-05 22:16:33,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:33,222 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:16:33,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:33,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:33,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:33,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:33,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:33,477 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:33,484 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:33,489 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:33,495 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:33,501 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:33,506 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:33,512 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:16:33,517 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:16:33,523 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:33,528 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:33,534 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:33,539 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:16:33,544 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:33,549 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:16:33,555 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:16:33,561 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:33,567 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:33,744 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 22:16:33,744 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 22:16:33,746 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:16:33,746 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 22:16:34,005 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-06-05 22:16:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:34,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165207634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:34,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:34,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:16:34,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038136543] [2021-06-05 22:16:34,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:16:34,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:34,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:16:34,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:16:34,196 INFO L87 Difference]: Start difference. First operand 280 states and 791 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:34,752 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-06-05 22:16:35,068 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2021-06-05 22:16:35,552 WARN L205 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2021-06-05 22:16:35,795 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2021-06-05 22:16:36,074 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2021-06-05 22:16:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:36,085 INFO L93 Difference]: Finished difference Result 431 states and 1187 transitions. [2021-06-05 22:16:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:16:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:36,086 INFO L225 Difference]: With dead ends: 431 [2021-06-05 22:16:36,086 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 22:16:36,086 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2451.0ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:16:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 22:16:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 286. [2021-06-05 22:16:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.831578947368421) internal successors, (807), 285 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 807 transitions. [2021-06-05 22:16:36,089 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 807 transitions. Word has length 20 [2021-06-05 22:16:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:36,089 INFO L482 AbstractCegarLoop]: Abstraction has 286 states and 807 transitions. [2021-06-05 22:16:36,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 807 transitions. [2021-06-05 22:16:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:36,090 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:36,090 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:36,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1178 [2021-06-05 22:16:36,290 INFO L430 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 602348684, now seen corresponding path program 6 times [2021-06-05 22:16:36,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:36,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850859166] [2021-06-05 22:16:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:36,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:36,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850859166] [2021-06-05 22:16:36,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850859166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:36,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715005549] [2021-06-05 22:16:36,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:36,677 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:16:36,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:36,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 22:16:36,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:37,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:16:37,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:37,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:37,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:37,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:37,680 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:37,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:37,688 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:37,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:37,700 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:37,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:37,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:37,712 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,264 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2021-06-05 22:16:38,265 INFO L628 ElimStorePlain]: treesize reduction 609, result has 46.9 percent of original size [2021-06-05 22:16:38,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:38,272 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:38,288 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:38,294 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,710 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:16:38,710 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 22:16:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:38,717 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:38,724 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:38,730 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,931 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:16:38,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:38,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:38,940 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:38,946 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:38,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:38,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:38,951 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:39,149 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:16:39,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:39,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:16:39,160 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1321, output treesize:433 [2021-06-05 22:16:39,379 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2021-06-05 22:16:40,718 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_141, get_6, v_prenex_131, v_prenex_121, v_prenex_143, v_prenex_133, v_prenex_145, v_prenex_123, v_prenex_135, v_prenex_125, v_prenex_147, v_prenex_158, v_prenex_115, v_prenex_137, v_prenex_127, v_prenex_149, v_prenex_117, v_prenex_139, v_prenex_129, v_prenex_119], 1=[v_prenex_150, v_prenex_140, v_prenex_130, v_prenex_120, v_prenex_142, v_prenex_132, v_prenex_122, v_prenex_144, v_prenex_134, v_prenex_146, v_prenex_124, get_0, v_prenex_136, v_prenex_126, v_prenex_148, v_prenex_159, v_prenex_116, v_prenex_138, v_prenex_128, v_prenex_118]} [2021-06-05 22:16:40,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 22:16:40,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:41,615 WARN L205 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 155 [2021-06-05 22:16:41,615 INFO L628 ElimStorePlain]: treesize reduction 1783, result has 23.5 percent of original size [2021-06-05 22:16:41,615 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 22:16:41,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:41,625 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:41,857 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2021-06-05 22:16:41,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:41,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:16:41,866 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:42,095 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-06-05 22:16:42,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:42,095 INFO L518 ElimStorePlain]: Eliminatee v_prenex_143 vanished before elimination [2021-06-05 22:16:42,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:42,105 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:42,332 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 22:16:42,332 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:42,332 INFO L518 ElimStorePlain]: Eliminatee v_prenex_145 vanished before elimination [2021-06-05 22:16:42,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:16:42,340 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:42,565 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 22:16:42,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:42,566 INFO L518 ElimStorePlain]: Eliminatee v_prenex_135 vanished before elimination [2021-06-05 22:16:42,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:42,575 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:42,802 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2021-06-05 22:16:42,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:42,803 INFO L518 ElimStorePlain]: Eliminatee v_prenex_147 vanished before elimination [2021-06-05 22:16:42,803 INFO L518 ElimStorePlain]: Eliminatee v_prenex_158 vanished before elimination [2021-06-05 22:16:42,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:16:42,812 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:43,027 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 22:16:43,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:43,028 INFO L518 ElimStorePlain]: Eliminatee v_prenex_137 vanished before elimination [2021-06-05 22:16:43,028 INFO L518 ElimStorePlain]: Eliminatee v_prenex_127 vanished before elimination [2021-06-05 22:16:43,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:43,035 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:43,248 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-06-05 22:16:43,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:43,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:16:43,256 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:43,465 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 22:16:43,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:43,465 INFO L518 ElimStorePlain]: Eliminatee v_prenex_139 vanished before elimination [2021-06-05 22:16:43,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:16:43,472 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:43,680 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:16:43,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:43,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:16:43,687 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:43,889 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:16:43,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:43,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_150 vanished before elimination [2021-06-05 22:16:43,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_140 vanished before elimination [2021-06-05 22:16:43,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_130 vanished before elimination [2021-06-05 22:16:43,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_120 vanished before elimination [2021-06-05 22:16:43,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_142 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_132 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_122 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_144 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_134 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_146 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_124 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_136 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_126 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_148 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_159 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_116 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_138 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_128 vanished before elimination [2021-06-05 22:16:43,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_118 vanished before elimination [2021-06-05 22:16:43,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 40 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:16:43,897 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 60 variables, input treesize:2339, output treesize:394 [2021-06-05 22:16:44,256 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2021-06-05 22:16:44,545 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-06-05 22:16:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:44,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715005549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:44,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:44,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:44,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606328847] [2021-06-05 22:16:44,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:44,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:44,781 INFO L87 Difference]: Start difference. First operand 286 states and 807 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:45,121 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2021-06-05 22:16:45,373 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2021-06-05 22:16:45,943 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 178 [2021-06-05 22:16:46,338 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2021-06-05 22:16:46,975 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 115 [2021-06-05 22:16:47,707 WARN L205 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2021-06-05 22:16:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:47,720 INFO L93 Difference]: Finished difference Result 452 states and 1230 transitions. [2021-06-05 22:16:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:16:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:47,720 INFO L225 Difference]: With dead ends: 452 [2021-06-05 22:16:47,720 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 22:16:47,721 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4242.6ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-06-05 22:16:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 22:16:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 289. [2021-06-05 22:16:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.829861111111111) internal successors, (815), 288 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 815 transitions. [2021-06-05 22:16:47,724 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 815 transitions. Word has length 20 [2021-06-05 22:16:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:47,724 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 815 transitions. [2021-06-05 22:16:47,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 815 transitions. [2021-06-05 22:16:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:47,724 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:47,724 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:47,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:47,925 INFO L430 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1096371704, now seen corresponding path program 7 times [2021-06-05 22:16:47,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:47,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152436933] [2021-06-05 22:16:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:48,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:48,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152436933] [2021-06-05 22:16:48,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152436933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:48,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17268069] [2021-06-05 22:16:48,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:48,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:48,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:48,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:48,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:48,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,032 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-06-05 22:16:49,032 INFO L628 ElimStorePlain]: treesize reduction 171, result has 67.2 percent of original size [2021-06-05 22:16:49,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:49,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,172 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 22:16:49,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:49,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:49,178 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,309 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:16:49,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:49,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:49,317 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:49,323 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,447 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:16:49,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:49,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:49,454 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:49,459 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,574 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:16:49,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:49,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:49,581 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:49,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:49,587 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:49,693 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:16:49,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:49,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:49,699 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 22:16:49,908 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 22:16:50,264 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:16:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:50,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17268069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:50,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:50,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:50,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629969296] [2021-06-05 22:16:50,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:50,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:50,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:50,437 INFO L87 Difference]: Start difference. First operand 289 states and 815 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:50,680 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 22:16:50,901 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2021-06-05 22:16:51,185 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2021-06-05 22:16:51,634 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 138 [2021-06-05 22:16:52,132 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2021-06-05 22:16:52,675 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2021-06-05 22:16:53,296 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 104 [2021-06-05 22:16:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:53,319 INFO L93 Difference]: Finished difference Result 429 states and 1188 transitions. [2021-06-05 22:16:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:16:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:53,320 INFO L225 Difference]: With dead ends: 429 [2021-06-05 22:16:53,320 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 22:16:53,320 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3547.0ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:16:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 22:16:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 283. [2021-06-05 22:16:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 2.8333333333333335) internal successors, (799), 282 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 799 transitions. [2021-06-05 22:16:53,323 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 799 transitions. Word has length 20 [2021-06-05 22:16:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:53,323 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 799 transitions. [2021-06-05 22:16:53,323 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 799 transitions. [2021-06-05 22:16:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:53,324 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:53,324 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:53,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1435 [2021-06-05 22:16:53,524 INFO L430 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1137578486, now seen corresponding path program 8 times [2021-06-05 22:16:53,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:53,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887674807] [2021-06-05 22:16:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:54,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:54,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887674807] [2021-06-05 22:16:54,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887674807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:54,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692316575] [2021-06-05 22:16:54,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:54,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:16:54,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:54,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:16:54,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:16:54,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:54,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:54,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:16:54,538 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:16:54,545 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:16:54,551 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:16:54,557 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,839 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 22:16:54,839 INFO L628 ElimStorePlain]: treesize reduction 338, result has 48.7 percent of original size [2021-06-05 22:16:54,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:54,845 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:54,851 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:54,856 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,972 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 22:16:54,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:16:54,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:16:54,978 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:16:54,984 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:54,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:16:54,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:16:54,989 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:16:55,193 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 22:16:55,193 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:16:55,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:16:55,200 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:246 [2021-06-05 22:16:55,685 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:16:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:55,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692316575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:55,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:16:55,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:16:55,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499718751] [2021-06-05 22:16:55,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:16:55,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:16:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:16:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:16:55,862 INFO L87 Difference]: Start difference. First operand 283 states and 799 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:56,112 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2021-06-05 22:16:56,334 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2021-06-05 22:16:56,622 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2021-06-05 22:16:57,098 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2021-06-05 22:16:57,615 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2021-06-05 22:16:58,183 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2021-06-05 22:16:58,458 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 103 [2021-06-05 22:16:59,116 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 118 [2021-06-05 22:16:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:16:59,163 INFO L93 Difference]: Finished difference Result 490 states and 1315 transitions. [2021-06-05 22:16:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:16:59,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:16:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:16:59,164 INFO L225 Difference]: With dead ends: 490 [2021-06-05 22:16:59,164 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 22:16:59,164 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4041.5ms TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:16:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 22:16:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 303. [2021-06-05 22:16:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.7880794701986753) internal successors, (842), 302 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 842 transitions. [2021-06-05 22:16:59,168 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 842 transitions. Word has length 20 [2021-06-05 22:16:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:16:59,168 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 842 transitions. [2021-06-05 22:16:59,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:16:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 842 transitions. [2021-06-05 22:16:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:16:59,168 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:16:59,169 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:16:59,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1506,210 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:59,369 INFO L430 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:16:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:16:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash -561141902, now seen corresponding path program 9 times [2021-06-05 22:16:59,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:16:59,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680042239] [2021-06-05 22:16:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:16:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:16:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:16:59,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:16:59,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680042239] [2021-06-05 22:16:59,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680042239] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:16:59,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201691204] [2021-06-05 22:16:59,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:16:59,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:16:59,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:16:59,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 22:16:59,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:00,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:00,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:00,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:01,291 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2021-06-05 22:17:01,292 INFO L628 ElimStorePlain]: treesize reduction 272, result has 68.9 percent of original size [2021-06-05 22:17:01,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:01,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:01,300 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:01,581 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2021-06-05 22:17:01,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:01,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:01,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:01,590 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:01,871 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 22:17:01,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:01,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:01,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:01,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:01,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:01,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:01,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:01,889 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,160 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 22:17:02,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:02,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:02,168 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:02,176 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,433 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 22:17:02,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:02,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:02,441 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:02,457 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,700 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 22:17:02,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:02,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:02,708 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:02,716 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:02,953 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 22:17:02,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:02,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:02,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:02,965 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:03,202 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:17:03,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:03,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:17:03,214 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:881, output treesize:471 [2021-06-05 22:17:03,642 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 150 [2021-06-05 22:17:04,068 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_261, v_prenex_251, get_6, v_prenex_241, v_prenex_253, v_prenex_231, v_prenex_243, v_prenex_255, v_prenex_233, v_prenex_245, v_prenex_267, v_prenex_257, v_prenex_235, v_prenex_247, v_prenex_259, v_prenex_237, v_prenex_227, v_prenex_249, v_prenex_239, v_prenex_229], 1=[get_3, v_prenex_260, v_prenex_250, v_prenex_240, v_prenex_252, v_prenex_230, v_prenex_242, v_prenex_254, v_prenex_232, v_prenex_244, v_prenex_266, v_prenex_256, v_prenex_234, v_prenex_246, v_prenex_258, v_prenex_236, v_prenex_226, v_prenex_248, v_prenex_238, v_prenex_228]} [2021-06-05 22:17:04,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 22:17:04,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:04,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:17:04,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:04,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:17:04,137 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:05,071 WARN L205 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 158 [2021-06-05 22:17:05,072 INFO L628 ElimStorePlain]: treesize reduction 1704, result has 24.1 percent of original size [2021-06-05 22:17:05,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:05,081 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:05,320 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-06-05 22:17:05,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:05,321 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 22:17:05,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_241 vanished before elimination [2021-06-05 22:17:05,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_253 vanished before elimination [2021-06-05 22:17:05,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_231 vanished before elimination [2021-06-05 22:17:05,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_243 vanished before elimination [2021-06-05 22:17:05,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:05,330 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:05,565 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2021-06-05 22:17:05,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:05,566 INFO L518 ElimStorePlain]: Eliminatee v_prenex_233 vanished before elimination [2021-06-05 22:17:05,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:05,575 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:05,806 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2021-06-05 22:17:05,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:05,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:05,815 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:06,040 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-06-05 22:17:06,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:06,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:06,048 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:06,268 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2021-06-05 22:17:06,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:06,269 INFO L518 ElimStorePlain]: Eliminatee v_prenex_235 vanished before elimination [2021-06-05 22:17:06,269 INFO L518 ElimStorePlain]: Eliminatee v_prenex_247 vanished before elimination [2021-06-05 22:17:06,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:06,276 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:06,501 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-05 22:17:06,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:06,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:06,508 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:06,723 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 22:17:06,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:06,724 INFO L518 ElimStorePlain]: Eliminatee v_prenex_227 vanished before elimination [2021-06-05 22:17:06,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:17:06,730 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:06,946 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 22:17:06,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:06,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:06,953 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:07,163 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 22:17:07,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_229 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_260 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_250 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_240 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_252 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_230 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_242 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_254 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_232 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_244 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_266 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_256 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_234 vanished before elimination [2021-06-05 22:17:07,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_246 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_258 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_236 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_226 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_248 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_238 vanished before elimination [2021-06-05 22:17:07,165 INFO L518 ElimStorePlain]: Eliminatee v_prenex_228 vanished before elimination [2021-06-05 22:17:07,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 40 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:17:07,171 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 60 variables, input treesize:2339, output treesize:409 [2021-06-05 22:17:07,547 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-06-05 22:17:07,843 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 22:17:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:08,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201691204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:08,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:08,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:08,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911630463] [2021-06-05 22:17:08,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:08,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:08,011 INFO L87 Difference]: Start difference. First operand 303 states and 842 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:08,426 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2021-06-05 22:17:08,778 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 22:17:09,467 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 197 [2021-06-05 22:17:10,092 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2021-06-05 22:17:10,849 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2021-06-05 22:17:11,025 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-05 22:17:11,728 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 131 [2021-06-05 22:17:11,923 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2021-06-05 22:17:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:11,953 INFO L93 Difference]: Finished difference Result 557 states and 1453 transitions. [2021-06-05 22:17:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:17:11,953 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:11,954 INFO L225 Difference]: With dead ends: 557 [2021-06-05 22:17:11,954 INFO L226 Difference]: Without dead ends: 517 [2021-06-05 22:17:11,954 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5294.2ms TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:17:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-06-05 22:17:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 309. [2021-06-05 22:17:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.814935064935065) internal successors, (867), 308 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 867 transitions. [2021-06-05 22:17:11,958 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 867 transitions. Word has length 20 [2021-06-05 22:17:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:11,958 INFO L482 AbstractCegarLoop]: Abstraction has 309 states and 867 transitions. [2021-06-05 22:17:11,958 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 867 transitions. [2021-06-05 22:17:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:11,958 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:11,958 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:12,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1585,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:12,159 INFO L430 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:12,159 INFO L82 PathProgramCache]: Analyzing trace with hash -734389594, now seen corresponding path program 10 times [2021-06-05 22:17:12,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:12,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010226876] [2021-06-05 22:17:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:12,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:12,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010226876] [2021-06-05 22:17:12,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010226876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:12,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381459310] [2021-06-05 22:17:12,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:12,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:17:12,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:12,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:17:12,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:13,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:13,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:13,317 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:13,326 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:17:13,336 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:13,345 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:13,353 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,778 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2021-06-05 22:17:13,779 INFO L628 ElimStorePlain]: treesize reduction 392, result has 49.9 percent of original size [2021-06-05 22:17:13,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:13,785 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:13,791 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:13,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:13,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:13,798 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:14,080 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 22:17:14,080 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:17:14,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:14,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:14,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:14,087 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:14,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:14,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:14,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:14,093 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:14,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:14,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:14,099 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:14,234 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-06-05 22:17:14,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:14,243 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:17:14,243 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:955, output treesize:292 [2021-06-05 22:17:14,398 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:17:14,659 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2021-06-05 22:17:15,458 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_290, v_prenex_292, v_prenex_294, get_6, v_prenex_296, v_prenex_286, v_prenex_298, v_prenex_288, v_prenex_300, v_prenex_302], 1=[get_3, v_prenex_291, v_prenex_293, v_prenex_295, v_prenex_285, v_prenex_297, v_prenex_287, v_prenex_299, v_prenex_289, v_prenex_301]} [2021-06-05 22:17:15,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:15,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:15,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:15,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:15,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:15,498 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:15,844 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 82 [2021-06-05 22:17:15,844 INFO L628 ElimStorePlain]: treesize reduction 690, result has 30.7 percent of original size [2021-06-05 22:17:15,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:15,849 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:15,965 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 22:17:15,965 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:15,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_294 vanished before elimination [2021-06-05 22:17:15,965 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 22:17:15,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_296 vanished before elimination [2021-06-05 22:17:15,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:15,971 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:16,086 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:17:16,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:16,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:16,096 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:16,207 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 22:17:16,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:16,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:16,212 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:16,320 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-06-05 22:17:16,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_300 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_302 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_291 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_293 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_295 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_285 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_297 vanished before elimination [2021-06-05 22:17:16,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_287 vanished before elimination [2021-06-05 22:17:16,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_299 vanished before elimination [2021-06-05 22:17:16,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_289 vanished before elimination [2021-06-05 22:17:16,321 INFO L518 ElimStorePlain]: Eliminatee v_prenex_301 vanished before elimination [2021-06-05 22:17:16,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 20 dim-1 vars, End of recursive call: and 11 xjuncts. [2021-06-05 22:17:16,323 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 30 variables, input treesize:1105, output treesize:224 [2021-06-05 22:17:16,476 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2021-06-05 22:17:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:16,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381459310] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:16,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:16,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:16,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023457531] [2021-06-05 22:17:16,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:16,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:16,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:16,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:16,591 INFO L87 Difference]: Start difference. First operand 309 states and 867 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:16,851 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-06-05 22:17:17,087 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2021-06-05 22:17:17,397 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2021-06-05 22:17:17,942 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 139 [2021-06-05 22:17:18,582 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 144 [2021-06-05 22:17:18,907 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2021-06-05 22:17:19,281 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2021-06-05 22:17:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:19,295 INFO L93 Difference]: Finished difference Result 442 states and 1218 transitions. [2021-06-05 22:17:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:17:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:19,295 INFO L225 Difference]: With dead ends: 442 [2021-06-05 22:17:19,295 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 22:17:19,296 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3530.6ms TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:17:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 22:17:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 292. [2021-06-05 22:17:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.8487972508591066) internal successors, (829), 291 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 829 transitions. [2021-06-05 22:17:19,299 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 829 transitions. Word has length 20 [2021-06-05 22:17:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:19,299 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 829 transitions. [2021-06-05 22:17:19,299 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 829 transitions. [2021-06-05 22:17:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:19,299 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:19,299 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:19,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1725,212 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:19,500 INFO L430 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2043738866, now seen corresponding path program 11 times [2021-06-05 22:17:19,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:19,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548659754] [2021-06-05 22:17:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:19,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:19,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548659754] [2021-06-05 22:17:19,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548659754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:19,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507904614] [2021-06-05 22:17:19,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:19,899 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:17:19,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:19,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:17:19,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:20,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:20,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:20,080 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:20,086 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:17:20,090 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:20,094 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:20,099 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:20,103 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:20,107 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:20,111 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:20,114 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:20,118 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:20,123 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:20,127 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:17:20,131 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:17:20,135 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:20,138 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:20,142 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:20,145 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:20,252 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-06-05 22:17:20,252 INFO L628 ElimStorePlain]: treesize reduction 91, result has 62.6 percent of original size [2021-06-05 22:17:20,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:17:20,254 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 22:17:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:20,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507904614] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:20,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:20,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:17:20,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591557607] [2021-06-05 22:17:20,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:17:20,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:17:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:17:20,610 INFO L87 Difference]: Start difference. First operand 292 states and 829 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:21,290 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-06-05 22:17:21,622 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2021-06-05 22:17:21,988 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2021-06-05 22:17:22,372 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2021-06-05 22:17:22,795 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 99 [2021-06-05 22:17:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:22,811 INFO L93 Difference]: Finished difference Result 541 states and 1472 transitions. [2021-06-05 22:17:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:17:22,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:22,812 INFO L225 Difference]: With dead ends: 541 [2021-06-05 22:17:22,812 INFO L226 Difference]: Without dead ends: 508 [2021-06-05 22:17:22,812 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2646.9ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:17:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-06-05 22:17:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 298. [2021-06-05 22:17:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.845117845117845) internal successors, (845), 297 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 845 transitions. [2021-06-05 22:17:22,816 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 845 transitions. Word has length 20 [2021-06-05 22:17:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:22,816 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 845 transitions. [2021-06-05 22:17:22,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 845 transitions. [2021-06-05 22:17:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:22,816 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:22,816 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:23,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1932,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:23,017 INFO L430 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:23,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1244698862, now seen corresponding path program 12 times [2021-06-05 22:17:23,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:23,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561363198] [2021-06-05 22:17:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:23,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:23,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561363198] [2021-06-05 22:17:23,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561363198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:23,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589554435] [2021-06-05 22:17:23,396 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:23,427 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:17:23,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:23,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 22:17:23,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:23,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:23,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:23,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,638 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:23,642 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,647 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:23,652 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,656 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,661 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:23,666 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:23,670 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:23,675 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,679 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:23,684 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:17:23,688 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:23,692 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:17:23,697 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:23,701 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:23,706 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:23,711 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:17:23,716 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:23,720 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:23,727 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:17:23,732 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:23,736 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:23,965 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-06-05 22:17:23,965 INFO L628 ElimStorePlain]: treesize reduction 194, result has 60.8 percent of original size [2021-06-05 22:17:23,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:17:23,968 INFO L247 ElimStorePlain]: Needed 25 recursive calls to eliminate 1 variables, input treesize:1081, output treesize:301 [2021-06-05 22:17:24,097 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-06-05 22:17:24,238 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-06-05 22:17:24,473 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-06-05 22:17:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:24,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589554435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:24,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:24,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:24,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168702503] [2021-06-05 22:17:24,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:24,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:24,804 INFO L87 Difference]: Start difference. First operand 298 states and 845 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:25,505 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2021-06-05 22:17:25,930 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-06-05 22:17:26,066 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-06-05 22:17:26,479 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2021-06-05 22:17:26,651 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2021-06-05 22:17:27,303 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2021-06-05 22:17:27,464 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 22:17:28,240 WARN L205 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2021-06-05 22:17:28,406 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2021-06-05 22:17:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:28,425 INFO L93 Difference]: Finished difference Result 648 states and 1733 transitions. [2021-06-05 22:17:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:17:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:28,426 INFO L225 Difference]: With dead ends: 648 [2021-06-05 22:17:28,426 INFO L226 Difference]: Without dead ends: 606 [2021-06-05 22:17:28,426 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4498.8ms TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:17:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-06-05 22:17:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 316. [2021-06-05 22:17:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.8444444444444446) internal successors, (896), 315 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 896 transitions. [2021-06-05 22:17:28,430 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 896 transitions. Word has length 20 [2021-06-05 22:17:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:28,430 INFO L482 AbstractCegarLoop]: Abstraction has 316 states and 896 transitions. [2021-06-05 22:17:28,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 896 transitions. [2021-06-05 22:17:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:28,430 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:28,430 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:28,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 214 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1953 [2021-06-05 22:17:28,631 INFO L430 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1723983538, now seen corresponding path program 13 times [2021-06-05 22:17:28,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:28,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624189309] [2021-06-05 22:17:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:28,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:28,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624189309] [2021-06-05 22:17:28,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624189309] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:28,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990759880] [2021-06-05 22:17:28,869 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:28,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:17:28,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:29,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:17:29,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:29,252 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:29,257 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:17:29,263 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:29,273 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:29,278 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,498 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2021-06-05 22:17:29,498 INFO L628 ElimStorePlain]: treesize reduction 317, result has 45.3 percent of original size [2021-06-05 22:17:29,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:29,504 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:29,509 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:29,514 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,678 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:17:29,678 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:17:29,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:29,684 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:29,689 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:29,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:29,697 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:29,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:29,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:17:29,780 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:757, output treesize:194 [2021-06-05 22:17:30,393 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:17:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:30,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990759880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:30,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:30,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:30,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315075972] [2021-06-05 22:17:30,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:30,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:30,556 INFO L87 Difference]: Start difference. First operand 316 states and 896 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:31,250 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2021-06-05 22:17:31,383 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2021-06-05 22:17:31,914 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2021-06-05 22:17:32,100 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2021-06-05 22:17:32,636 WARN L205 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 122 [2021-06-05 22:17:32,815 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 22:17:33,204 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 128 [2021-06-05 22:17:33,406 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-06-05 22:17:34,052 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2021-06-05 22:17:34,253 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 22:17:34,411 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-06-05 22:17:34,954 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 133 [2021-06-05 22:17:35,352 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 139 [2021-06-05 22:17:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:35,402 INFO L93 Difference]: Finished difference Result 728 states and 1904 transitions. [2021-06-05 22:17:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 22:17:35,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:35,403 INFO L225 Difference]: With dead ends: 728 [2021-06-05 22:17:35,403 INFO L226 Difference]: Without dead ends: 692 [2021-06-05 22:17:35,403 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 5272.7ms TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 22:17:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-05 22:17:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 322. [2021-06-05 22:17:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.8598130841121496) internal successors, (918), 321 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 918 transitions. [2021-06-05 22:17:35,408 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 918 transitions. Word has length 20 [2021-06-05 22:17:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:35,408 INFO L482 AbstractCegarLoop]: Abstraction has 322 states and 918 transitions. [2021-06-05 22:17:35,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 918 transitions. [2021-06-05 22:17:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:35,408 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:35,408 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:35,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1985,215 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:35,609 INFO L430 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash 25263150, now seen corresponding path program 14 times [2021-06-05 22:17:35,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:35,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483151499] [2021-06-05 22:17:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:36,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:36,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483151499] [2021-06-05 22:17:36,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483151499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:36,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70038725] [2021-06-05 22:17:36,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:36,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:17:36,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:36,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:17:36,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:36,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:36,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,638 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 22:17:36,638 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 22:17:36,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:36,644 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,752 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:17:36,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:36,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:36,758 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,864 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:17:36,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:36,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:36,871 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:36,876 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:36,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:36,981 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:36,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:36,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:36,986 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:37,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:37,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:37,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:37,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:37,085 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:37,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:37,092 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:37,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:37,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:17:37,191 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 22:17:37,352 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:17:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:37,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70038725] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:37,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:37,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:37,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746413522] [2021-06-05 22:17:37,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:37,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:37,998 INFO L87 Difference]: Start difference. First operand 322 states and 918 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:38,245 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 22:17:38,525 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2021-06-05 22:17:38,942 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 133 [2021-06-05 22:17:39,429 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 137 [2021-06-05 22:17:40,234 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 153 [2021-06-05 22:17:41,095 WARN L205 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 158 [2021-06-05 22:17:42,044 WARN L205 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 165 [2021-06-05 22:17:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:42,073 INFO L93 Difference]: Finished difference Result 554 states and 1525 transitions. [2021-06-05 22:17:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:17:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:42,074 INFO L225 Difference]: With dead ends: 554 [2021-06-05 22:17:42,074 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 22:17:42,074 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4728.1ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:17:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 22:17:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 313. [2021-06-05 22:17:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 2.8653846153846154) internal successors, (894), 312 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 894 transitions. [2021-06-05 22:17:42,078 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 894 transitions. Word has length 20 [2021-06-05 22:17:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:42,078 INFO L482 AbstractCegarLoop]: Abstraction has 313 states and 894 transitions. [2021-06-05 22:17:42,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 894 transitions. [2021-06-05 22:17:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:42,079 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:42,079 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:42,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2065,216 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:42,279 INFO L430 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1163299806, now seen corresponding path program 15 times [2021-06-05 22:17:42,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:42,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909287356] [2021-06-05 22:17:42,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:42,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:42,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909287356] [2021-06-05 22:17:42,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909287356] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:42,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630278031] [2021-06-05 22:17:42,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:42,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:17:42,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:42,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:17:42,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:43,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:43,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:44,140 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 130 [2021-06-05 22:17:44,140 INFO L628 ElimStorePlain]: treesize reduction 248, result has 68.1 percent of original size [2021-06-05 22:17:44,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:44,148 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:44,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:44,166 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:44,375 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 22:17:44,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:44,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:44,384 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:44,595 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 22:17:44,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:44,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:44,602 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:44,805 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 22:17:44,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:44,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:44,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:44,812 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,016 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:17:45,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:45,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:45,024 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:45,031 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,233 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:17:45,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:45,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:45,240 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:45,247 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,430 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:17:45,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:45,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:45,437 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:45,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:45,443 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:45,623 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:17:45,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:45,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:17:45,633 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:785, output treesize:399 [2021-06-05 22:17:45,975 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-05 22:17:46,283 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2021-06-05 22:17:46,621 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_361, get_6, v_prenex_363, v_prenex_365, v_prenex_367, v_prenex_359], 1=[v_prenex_360, v_prenex_362, v_prenex_364, v_prenex_366, get_0, v_prenex_368]} [2021-06-05 22:17:46,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:46,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:46,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:46,638 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:46,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:46,647 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:46,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:17:46,656 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:46,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:17:46,665 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:46,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:17:46,674 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,100 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 90 [2021-06-05 22:17:47,100 INFO L628 ElimStorePlain]: treesize reduction 1568, result has 14.9 percent of original size [2021-06-05 22:17:47,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:47,110 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,214 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:17:47,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:47,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:47,220 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,329 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 22:17:47,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:47,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:47,335 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:47,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:47,439 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:47,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:47,541 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:47,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_360 vanished before elimination [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_362 vanished before elimination [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_364 vanished before elimination [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_366 vanished before elimination [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:17:47,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_368 vanished before elimination [2021-06-05 22:17:47,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:17:47,639 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:1953, output treesize:187 [2021-06-05 22:17:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:47,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630278031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:47,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:47,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:47,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163095349] [2021-06-05 22:17:47,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:47,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:47,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:47,846 INFO L87 Difference]: Start difference. First operand 313 states and 894 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:48,205 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:17:48,420 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 22:17:48,944 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 175 [2021-06-05 22:17:49,867 WARN L205 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2021-06-05 22:17:50,292 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2021-06-05 22:17:50,796 WARN L205 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 [2021-06-05 22:17:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:50,807 INFO L93 Difference]: Finished difference Result 480 states and 1332 transitions. [2021-06-05 22:17:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:17:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:50,807 INFO L225 Difference]: With dead ends: 480 [2021-06-05 22:17:50,808 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 22:17:50,808 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4172.9ms TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2021-06-05 22:17:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 22:17:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 319. [2021-06-05 22:17:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.861635220125786) internal successors, (910), 318 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 910 transitions. [2021-06-05 22:17:50,811 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 910 transitions. Word has length 20 [2021-06-05 22:17:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:50,811 INFO L482 AbstractCegarLoop]: Abstraction has 319 states and 910 transitions. [2021-06-05 22:17:50,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 910 transitions. [2021-06-05 22:17:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:50,811 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:50,811 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:51,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2161 [2021-06-05 22:17:51,012 INFO L430 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1642584482, now seen corresponding path program 16 times [2021-06-05 22:17:51,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:51,012 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087871335] [2021-06-05 22:17:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:17:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:51,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:17:51,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087871335] [2021-06-05 22:17:51,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087871335] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:51,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112337865] [2021-06-05 22:17:51,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:17:51,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:17:51,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:17:51,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:17:51,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:17:51,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:51,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:51,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,319 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2021-06-05 22:17:52,320 INFO L628 ElimStorePlain]: treesize reduction 180, result has 67.7 percent of original size [2021-06-05 22:17:52,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:52,327 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,485 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:17:52,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:52,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:52,491 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,648 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:17:52,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:52,655 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:52,662 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,807 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:17:52,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:52,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:52,816 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:52,822 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,961 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:17:52,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:52,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:17:52,968 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:52,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:17:52,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:52,974 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:53,104 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:17:53,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:53,110 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:17:53,110 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:565, output treesize:268 [2021-06-05 22:17:53,343 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2021-06-05 22:17:54,110 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_391, v_prenex_381, get_6, v_prenex_383, v_prenex_385, v_prenex_387, v_prenex_389], 1=[v_prenex_390, v_prenex_392, v_prenex_382, v_prenex_384, v_prenex_386, v_prenex_388, get_0]} [2021-06-05 22:17:54,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 22:17:54,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:17:54,137 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:17:54,148 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:17:54,160 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:17:54,172 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:17:54,183 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,769 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 103 [2021-06-05 22:17:54,770 INFO L628 ElimStorePlain]: treesize reduction 1759, result has 17.1 percent of original size [2021-06-05 22:17:54,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:54,780 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:54,935 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:17:54,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:54,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:54,942 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:55,097 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:17:55,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:55,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:17:55,104 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:55,248 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:17:55,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:55,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:17:55,255 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:55,398 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:17:55,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:55,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:17:55,403 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:55,542 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:17:55,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:55,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:17:55,549 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:17:55,684 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:17:55,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_390 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_392 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_382 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_384 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_386 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee v_prenex_388 vanished before elimination [2021-06-05 22:17:55,685 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:17:55,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:17:55,688 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 22:17:55,826 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:17:56,045 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:17:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:17:56,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112337865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:17:56,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:17:56,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:17:56,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390018966] [2021-06-05 22:17:56,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:17:56,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:17:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:17:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:17:56,222 INFO L87 Difference]: Start difference. First operand 319 states and 910 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:56,486 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2021-06-05 22:17:56,810 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2021-06-05 22:17:57,091 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2021-06-05 22:17:57,742 WARN L205 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 140 [2021-06-05 22:17:58,306 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 84 [2021-06-05 22:17:58,948 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 99 [2021-06-05 22:17:59,755 WARN L205 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 110 [2021-06-05 22:17:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:17:59,771 INFO L93 Difference]: Finished difference Result 501 states and 1375 transitions. [2021-06-05 22:17:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:17:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:17:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:17:59,772 INFO L225 Difference]: With dead ends: 501 [2021-06-05 22:17:59,772 INFO L226 Difference]: Without dead ends: 480 [2021-06-05 22:17:59,772 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4472.3ms TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:17:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-06-05 22:17:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 322. [2021-06-05 22:17:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.8598130841121496) internal successors, (918), 321 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 918 transitions. [2021-06-05 22:17:59,776 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 918 transitions. Word has length 20 [2021-06-05 22:17:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:17:59,776 INFO L482 AbstractCegarLoop]: Abstraction has 322 states and 918 transitions. [2021-06-05 22:17:59,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:17:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 918 transitions. [2021-06-05 22:17:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:17:59,777 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:17:59,777 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:17:59,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 218 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2342 [2021-06-05 22:17:59,977 INFO L430 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:17:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:17:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -56135906, now seen corresponding path program 17 times [2021-06-05 22:17:59,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:17:59,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873726980] [2021-06-05 22:17:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:17:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:00,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:00,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873726980] [2021-06-05 22:18:00,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873726980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:00,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483147797] [2021-06-05 22:18:00,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:00,391 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:18:00,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:00,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:18:00,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:00,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:00,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:00,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:00,645 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:00,651 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:00,657 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:00,662 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:00,668 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:00,674 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:00,680 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:00,686 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:00,692 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:00,699 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:00,704 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:00,708 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:00,713 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:00,717 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:00,721 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:00,725 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:00,864 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 22:18:00,865 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 22:18:00,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:18:00,866 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 22:18:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:01,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483147797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:01,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:01,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:18:01,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746523561] [2021-06-05 22:18:01,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:18:01,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:01,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:18:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:18:01,227 INFO L87 Difference]: Start difference. First operand 322 states and 918 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:01,830 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2021-06-05 22:18:02,143 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2021-06-05 22:18:02,521 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2021-06-05 22:18:02,932 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2021-06-05 22:18:03,426 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2021-06-05 22:18:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:03,446 INFO L93 Difference]: Finished difference Result 478 states and 1333 transitions. [2021-06-05 22:18:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:03,447 INFO L225 Difference]: With dead ends: 478 [2021-06-05 22:18:03,447 INFO L226 Difference]: Without dead ends: 463 [2021-06-05 22:18:03,447 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2715.7ms TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:18:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-06-05 22:18:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 316. [2021-06-05 22:18:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.8634920634920635) internal successors, (902), 315 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 902 transitions. [2021-06-05 22:18:03,451 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 902 transitions. Word has length 20 [2021-06-05 22:18:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:03,451 INFO L482 AbstractCegarLoop]: Abstraction has 316 states and 902 transitions. [2021-06-05 22:18:03,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 902 transitions. [2021-06-05 22:18:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:03,451 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:03,451 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:03,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2577 [2021-06-05 22:18:03,652 INFO L430 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2117153012, now seen corresponding path program 18 times [2021-06-05 22:18:03,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:03,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394582519] [2021-06-05 22:18:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:04,026 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 22:18:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:04,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:04,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394582519] [2021-06-05 22:18:04,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394582519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:04,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339376897] [2021-06-05 22:18:04,262 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:04,309 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:18:04,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:04,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:18:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:04,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:04,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:04,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:04,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:04,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:04,722 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:04,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:04,729 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:04,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:04,738 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:04,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:04,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:04,744 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,028 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:18:05,028 INFO L628 ElimStorePlain]: treesize reduction 339, result has 48.1 percent of original size [2021-06-05 22:18:05,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:05,034 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:05,040 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:05,045 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,162 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 22:18:05,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:05,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:05,169 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:05,174 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:05,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:05,179 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:05,384 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:18:05,385 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:18:05,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:18:05,391 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:239 [2021-06-05 22:18:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:05,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339376897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:05,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:05,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:05,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038427160] [2021-06-05 22:18:05,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:05,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:05,992 INFO L87 Difference]: Start difference. First operand 316 states and 902 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:06,240 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2021-06-05 22:18:06,559 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2021-06-05 22:18:06,810 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2021-06-05 22:18:07,419 WARN L205 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 128 [2021-06-05 22:18:07,855 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2021-06-05 22:18:08,220 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2021-06-05 22:18:08,657 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 111 [2021-06-05 22:18:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:08,672 INFO L93 Difference]: Finished difference Result 505 states and 1382 transitions. [2021-06-05 22:18:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:08,673 INFO L225 Difference]: With dead ends: 505 [2021-06-05 22:18:08,673 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 22:18:08,673 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3444.5ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:18:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 22:18:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 322. [2021-06-05 22:18:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.8598130841121496) internal successors, (918), 321 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 918 transitions. [2021-06-05 22:18:08,677 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 918 transitions. Word has length 20 [2021-06-05 22:18:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:08,677 INFO L482 AbstractCegarLoop]: Abstraction has 322 states and 918 transitions. [2021-06-05 22:18:08,677 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 918 transitions. [2021-06-05 22:18:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:08,677 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:08,677 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:08,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2607,220 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:08,878 INFO L430 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:08,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash 479093896, now seen corresponding path program 19 times [2021-06-05 22:18:08,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:08,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348750969] [2021-06-05 22:18:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:09,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:09,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348750969] [2021-06-05 22:18:09,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348750969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:09,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700722018] [2021-06-05 22:18:09,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:09,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:18:09,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:10,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:10,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:10,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:10,705 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 130 [2021-06-05 22:18:10,706 INFO L628 ElimStorePlain]: treesize reduction 248, result has 68.1 percent of original size [2021-06-05 22:18:10,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:10,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:10,727 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:10,947 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2021-06-05 22:18:10,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:10,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:10,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:10,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,172 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-05 22:18:11,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:11,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:11,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:11,187 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,396 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 22:18:11,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:11,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:11,405 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,620 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 22:18:11,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:11,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:11,627 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:11,634 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,831 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:18:11,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:11,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:11,838 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:11,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:11,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:11,845 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:12,027 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:18:12,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:12,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:12,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:12,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:12,046 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:12,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:12,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:12,052 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:12,230 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:18:12,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:12,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:18:12,240 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:785, output treesize:399 [2021-06-05 22:18:12,582 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-05 22:18:12,866 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_426, v_prenex_448, v_prenex_438, v_prenex_428, get_6, v_prenex_451, v_prenex_440, v_prenex_430, v_prenex_442, v_prenex_422, v_prenex_434, v_prenex_424], 1=[v_prenex_437, get_3, v_prenex_427, v_prenex_439, v_prenex_429, v_prenex_450, v_prenex_441, v_prenex_421, v_prenex_433, v_prenex_423, v_prenex_425, v_prenex_447]} [2021-06-05 22:18:12,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:12,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:12,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:12,891 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:12,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:12,902 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:13,409 WARN L205 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 105 [2021-06-05 22:18:13,410 INFO L628 ElimStorePlain]: treesize reduction 989, result has 28.2 percent of original size [2021-06-05 22:18:13,410 INFO L518 ElimStorePlain]: Eliminatee v_prenex_448 vanished before elimination [2021-06-05 22:18:13,410 INFO L518 ElimStorePlain]: Eliminatee v_prenex_438 vanished before elimination [2021-06-05 22:18:13,410 INFO L518 ElimStorePlain]: Eliminatee v_prenex_428 vanished before elimination [2021-06-05 22:18:13,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:13,417 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:13,576 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:18:13,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:13,576 INFO L518 ElimStorePlain]: Eliminatee v_prenex_451 vanished before elimination [2021-06-05 22:18:13,576 INFO L518 ElimStorePlain]: Eliminatee v_prenex_440 vanished before elimination [2021-06-05 22:18:13,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:13,583 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:13,736 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:18:13,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:13,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:13,742 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:13,893 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:18:13,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:13,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:13,899 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:14,046 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:18:14,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:14,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:14,052 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:14,200 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:18:14,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:14,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:14,205 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:14,350 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 22:18:14,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_437 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_427 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_439 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_429 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_450 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_441 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_421 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_433 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_423 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_425 vanished before elimination [2021-06-05 22:18:14,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_447 vanished before elimination [2021-06-05 22:18:14,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 24 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:18:14,356 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 36 variables, input treesize:1407, output treesize:283 [2021-06-05 22:18:14,507 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 22:18:14,713 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 22:18:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:14,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700722018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:14,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:14,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:14,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700159848] [2021-06-05 22:18:14,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:14,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:14,806 INFO L87 Difference]: Start difference. First operand 322 states and 918 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:15,191 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:18:15,467 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 22:18:16,088 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 184 [2021-06-05 22:18:16,635 WARN L205 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2021-06-05 22:18:17,234 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 124 [2021-06-05 22:18:17,931 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 133 [2021-06-05 22:18:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:17,959 INFO L93 Difference]: Finished difference Result 506 states and 1388 transitions. [2021-06-05 22:18:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:17,959 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:17,960 INFO L225 Difference]: With dead ends: 506 [2021-06-05 22:18:17,960 INFO L226 Difference]: Without dead ends: 491 [2021-06-05 22:18:17,960 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4291.0ms TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-06-05 22:18:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-06-05 22:18:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 319. [2021-06-05 22:18:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.861635220125786) internal successors, (910), 318 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 910 transitions. [2021-06-05 22:18:17,963 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 910 transitions. Word has length 20 [2021-06-05 22:18:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:17,964 INFO L482 AbstractCegarLoop]: Abstraction has 319 states and 910 transitions. [2021-06-05 22:18:17,964 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 910 transitions. [2021-06-05 22:18:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:17,964 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:17,964 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:18,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2712,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:18,165 INFO L430 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 305846204, now seen corresponding path program 20 times [2021-06-05 22:18:18,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:18,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523978318] [2021-06-05 22:18:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:18,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:18,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523978318] [2021-06-05 22:18:18,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523978318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:18,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893671815] [2021-06-05 22:18:18,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:18,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:18:18,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:18,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 22:18:18,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:19,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:19,464 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:19,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:19,475 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:19,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:19,486 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:19,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:19,498 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:19,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:19,508 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:19,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:19,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:19,517 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,118 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2021-06-05 22:18:20,118 INFO L628 ElimStorePlain]: treesize reduction 622, result has 47.6 percent of original size [2021-06-05 22:18:20,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:20,126 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:20,134 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:20,141 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,649 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2021-06-05 22:18:20,650 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 22:18:20,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:20,657 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:20,664 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:20,671 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,910 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:18:20,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:20,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:20,918 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:20,925 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:20,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:20,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:20,931 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:21,161 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 22:18:21,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:21,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:18:21,173 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1393, output treesize:476 [2021-06-05 22:18:21,407 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-06-05 22:18:21,836 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 136 [2021-06-05 22:18:22,235 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_481, get_6, v_prenex_483, v_prenex_485, v_prenex_475, v_prenex_487, v_prenex_477, v_prenex_489, v_prenex_479], 1=[get_3, v_prenex_480, v_prenex_482, v_prenex_484, v_prenex_474, v_prenex_486, v_prenex_476, v_prenex_488, v_prenex_478]} [2021-06-05 22:18:22,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:22,250 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:22,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:22,264 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:22,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:22,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:22,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:22,293 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:22,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:22,309 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:22,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:22,324 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:23,182 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 145 [2021-06-05 22:18:23,183 INFO L628 ElimStorePlain]: treesize reduction 2564, result has 15.7 percent of original size [2021-06-05 22:18:23,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:23,191 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:23,383 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-06-05 22:18:23,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:23,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:23,392 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:23,580 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 22:18:23,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:23,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:23,589 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:23,776 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-06-05 22:18:23,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:23,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:23,784 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:23,966 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 22:18:23,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:23,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:23,975 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:24,153 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:18:24,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:24,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:24,161 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:24,338 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:18:24,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:24,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:24,346 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:24,689 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2021-06-05 22:18:24,690 INFO L628 ElimStorePlain]: treesize reduction 7, result has 98.3 percent of original size [2021-06-05 22:18:24,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:18:24,695 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:24,863 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 22:18:24,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_480 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_482 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_484 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_474 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_486 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_476 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_488 vanished before elimination [2021-06-05 22:18:24,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_478 vanished before elimination [2021-06-05 22:18:24,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 18 dim-1 vars, End of recursive call: and 15 xjuncts. [2021-06-05 22:18:24,869 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 27 variables, input treesize:3259, output treesize:348 [2021-06-05 22:18:25,157 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-06-05 22:18:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:25,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893671815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:25,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:25,305 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:25,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316881273] [2021-06-05 22:18:25,305 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:25,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:25,305 INFO L87 Difference]: Start difference. First operand 319 states and 910 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:25,477 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:18:25,790 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:18:26,054 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2021-06-05 22:18:26,707 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 190 [2021-06-05 22:18:28,168 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 237 DAG size of output: 221 [2021-06-05 22:18:28,667 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2021-06-05 22:18:29,252 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2021-06-05 22:18:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:29,286 INFO L93 Difference]: Finished difference Result 479 states and 1332 transitions. [2021-06-05 22:18:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:29,287 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:29,287 INFO L225 Difference]: With dead ends: 479 [2021-06-05 22:18:29,287 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 22:18:29,287 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 5043.9ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-06-05 22:18:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 22:18:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 316. [2021-06-05 22:18:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.8634920634920635) internal successors, (902), 315 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 902 transitions. [2021-06-05 22:18:29,291 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 902 transitions. Word has length 20 [2021-06-05 22:18:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:29,291 INFO L482 AbstractCegarLoop]: Abstraction has 316 states and 902 transitions. [2021-06-05 22:18:29,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 902 transitions. [2021-06-05 22:18:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:29,291 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:29,291 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:29,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2829,222 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:29,492 INFO L430 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:29,492 INFO L82 PathProgramCache]: Analyzing trace with hash -361470104, now seen corresponding path program 21 times [2021-06-05 22:18:29,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:29,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473004292] [2021-06-05 22:18:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:29,843 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-06-05 22:18:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:30,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:30,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473004292] [2021-06-05 22:18:30,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473004292] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:30,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374391287] [2021-06-05 22:18:30,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:30,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:18:30,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:30,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:18:30,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:30,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:30,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:30,394 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:30,399 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:30,404 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:30,408 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:30,413 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:30,419 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:30,424 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:30,428 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:30,433 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:30,437 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:30,441 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:30,445 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:30,450 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:30,454 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:30,458 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:30,462 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:30,466 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:30,596 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2021-06-05 22:18:30,597 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 22:18:30,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:18:30,598 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 22:18:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:31,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374391287] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:31,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:31,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:31,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769236992] [2021-06-05 22:18:31,141 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:31,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:31,141 INFO L87 Difference]: Start difference. First operand 316 states and 902 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:31,518 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-06-05 22:18:31,832 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2021-06-05 22:18:32,288 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 100 [2021-06-05 22:18:32,482 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 38 [2021-06-05 22:18:32,929 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 110 [2021-06-05 22:18:33,120 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 40 [2021-06-05 22:18:34,102 WARN L205 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 119 [2021-06-05 22:18:34,965 WARN L205 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 126 [2021-06-05 22:18:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:35,000 INFO L93 Difference]: Finished difference Result 612 states and 1679 transitions. [2021-06-05 22:18:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:18:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:35,001 INFO L225 Difference]: With dead ends: 612 [2021-06-05 22:18:35,001 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 22:18:35,001 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4673.0ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:18:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 22:18:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 332. [2021-06-05 22:18:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.876132930513595) internal successors, (952), 331 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 952 transitions. [2021-06-05 22:18:35,005 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 952 transitions. Word has length 20 [2021-06-05 22:18:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:35,005 INFO L482 AbstractCegarLoop]: Abstraction has 332 states and 952 transitions. [2021-06-05 22:18:35,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 952 transitions. [2021-06-05 22:18:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:35,005 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:35,005 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:35,206 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 223 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3045 [2021-06-05 22:18:35,206 INFO L430 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:35,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash -758387758, now seen corresponding path program 22 times [2021-06-05 22:18:35,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:35,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826223555] [2021-06-05 22:18:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:35,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:35,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826223555] [2021-06-05 22:18:35,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826223555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:35,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062790074] [2021-06-05 22:18:35,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:35,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:18:35,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:35,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:18:35,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:36,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:36,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:36,337 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:36,344 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:36,350 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:36,357 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:36,362 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,682 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-06-05 22:18:36,682 INFO L628 ElimStorePlain]: treesize reduction 402, result has 46.8 percent of original size [2021-06-05 22:18:36,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:36,688 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:36,694 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:36,700 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,958 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2021-06-05 22:18:36,958 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:18:36,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:36,964 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:36,976 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:36,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:36,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:36,981 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,192 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 22:18:37,192 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:18:37,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:18:37,199 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:865, output treesize:240 [2021-06-05 22:18:37,499 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:18:37,775 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_504, v_prenex_506, v_prenex_508, get_6, v_prenex_510, v_prenex_512, v_prenex_502], 1=[v_prenex_503, get_3, v_prenex_505, v_prenex_507, v_prenex_509, v_prenex_511, v_prenex_501]} [2021-06-05 22:18:37,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:37,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:37,800 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:37,812 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:37,824 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:37,836 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:37,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:37,849 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:38,427 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 103 [2021-06-05 22:18:38,428 INFO L628 ElimStorePlain]: treesize reduction 1722, result has 17.2 percent of original size [2021-06-05 22:18:38,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:38,434 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:38,586 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:18:38,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:38,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:18:38,593 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:38,748 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 22:18:38,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:38,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:38,755 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:38,898 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:18:38,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:38,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:18:38,904 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:39,043 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:18:39,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:39,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:18:39,050 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:39,186 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:18:39,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:39,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:18:39,192 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:39,326 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:18:39,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_503 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_505 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_507 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_509 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_511 vanished before elimination [2021-06-05 22:18:39,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_501 vanished before elimination [2021-06-05 22:18:39,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:18:39,330 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2245, output treesize:253 [2021-06-05 22:18:39,469 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:18:39,681 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:18:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:39,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062790074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:39,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:39,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:39,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930432920] [2021-06-05 22:18:39,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:39,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:39,859 INFO L87 Difference]: Start difference. First operand 332 states and 952 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:40,325 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2021-06-05 22:18:40,835 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2021-06-05 22:18:41,441 WARN L205 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 124 [2021-06-05 22:18:42,135 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2021-06-05 22:18:42,957 WARN L205 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 148 [2021-06-05 22:18:43,928 WARN L205 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 161 [2021-06-05 22:18:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:43,945 INFO L93 Difference]: Finished difference Result 588 states and 1578 transitions. [2021-06-05 22:18:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:43,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:43,946 INFO L225 Difference]: With dead ends: 588 [2021-06-05 22:18:43,946 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 22:18:43,946 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5037.4ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:18:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 22:18:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 338. [2021-06-05 22:18:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.8724035608308607) internal successors, (968), 337 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 968 transitions. [2021-06-05 22:18:43,950 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 968 transitions. Word has length 20 [2021-06-05 22:18:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:43,950 INFO L482 AbstractCegarLoop]: Abstraction has 338 states and 968 transitions. [2021-06-05 22:18:43,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 968 transitions. [2021-06-05 22:18:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:43,951 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:43,951 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:44,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3077 [2021-06-05 22:18:44,151 INFO L430 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:44,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1837859150, now seen corresponding path program 23 times [2021-06-05 22:18:44,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:44,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020755977] [2021-06-05 22:18:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:44,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:44,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020755977] [2021-06-05 22:18:44,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020755977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:44,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20768503] [2021-06-05 22:18:44,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:44,645 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:18:44,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:44,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:18:44,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:44,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:44,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:44,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:44,836 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:44,840 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:44,844 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:44,847 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:44,851 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:44,855 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:44,859 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:44,863 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:18:44,867 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:44,871 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:44,875 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:44,878 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:44,882 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:18:44,886 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:44,890 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:44,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:44,893 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:45,000 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2021-06-05 22:18:45,000 INFO L628 ElimStorePlain]: treesize reduction 97, result has 61.0 percent of original size [2021-06-05 22:18:45,002 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:18:45,002 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 22:18:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:45,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20768503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:45,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:45,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:18:45,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088052311] [2021-06-05 22:18:45,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:18:45,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:18:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:18:45,434 INFO L87 Difference]: Start difference. First operand 338 states and 968 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:45,800 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-06-05 22:18:46,072 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2021-06-05 22:18:46,367 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2021-06-05 22:18:46,885 WARN L205 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2021-06-05 22:18:47,373 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2021-06-05 22:18:47,926 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2021-06-05 22:18:48,646 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2021-06-05 22:18:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:48,672 INFO L93 Difference]: Finished difference Result 620 states and 1654 transitions. [2021-06-05 22:18:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:18:48,673 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:48,674 INFO L225 Difference]: With dead ends: 620 [2021-06-05 22:18:48,674 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 22:18:48,674 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3792.4ms TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:18:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 22:18:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 349. [2021-06-05 22:18:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.82183908045977) internal successors, (982), 348 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 982 transitions. [2021-06-05 22:18:48,678 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 982 transitions. Word has length 20 [2021-06-05 22:18:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:48,678 INFO L482 AbstractCegarLoop]: Abstraction has 349 states and 982 transitions. [2021-06-05 22:18:48,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 982 transitions. [2021-06-05 22:18:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:48,678 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:48,678 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:48,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 225 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3243 [2021-06-05 22:18:48,881 INFO L430 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1664611458, now seen corresponding path program 24 times [2021-06-05 22:18:48,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:48,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517907814] [2021-06-05 22:18:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:49,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:49,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517907814] [2021-06-05 22:18:49,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517907814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:49,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340246823] [2021-06-05 22:18:49,243 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:49,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:18:49,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:49,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:18:49,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:49,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:49,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:49,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:49,856 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 22:18:49,856 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 22:18:49,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:49,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:49,862 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:49,970 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:18:49,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:49,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:49,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:49,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:49,977 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:49,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:49,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:49,983 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:50,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:50,088 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:50,094 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:50,195 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,288 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:50,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:50,295 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:50,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:50,300 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:50,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:50,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:18:50,387 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 22:18:50,544 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 22:18:50,888 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2021-06-05 22:18:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:51,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340246823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:51,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:51,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:51,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614685738] [2021-06-05 22:18:51,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:51,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:51,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:51,195 INFO L87 Difference]: Start difference. First operand 349 states and 982 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:51,446 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 22:18:51,981 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 22:18:52,157 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-06-05 22:18:52,492 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-05 22:18:52,746 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 22:18:52,925 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-05 22:18:53,215 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-05 22:18:53,398 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 22:18:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:53,535 INFO L93 Difference]: Finished difference Result 670 states and 1796 transitions. [2021-06-05 22:18:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 22:18:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:53,536 INFO L225 Difference]: With dead ends: 670 [2021-06-05 22:18:53,536 INFO L226 Difference]: Without dead ends: 618 [2021-06-05 22:18:53,536 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2884.9ms TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2021-06-05 22:18:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-06-05 22:18:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 342. [2021-06-05 22:18:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.8856304985337244) internal successors, (984), 341 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 984 transitions. [2021-06-05 22:18:53,540 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 984 transitions. Word has length 20 [2021-06-05 22:18:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:53,540 INFO L482 AbstractCegarLoop]: Abstraction has 342 states and 984 transitions. [2021-06-05 22:18:53,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 984 transitions. [2021-06-05 22:18:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:53,541 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:53,541 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:53,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 226 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3265 [2021-06-05 22:18:53,741 INFO L430 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -678810648, now seen corresponding path program 25 times [2021-06-05 22:18:53,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:53,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171719519] [2021-06-05 22:18:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:54,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:54,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171719519] [2021-06-05 22:18:54,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171719519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:54,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890808435] [2021-06-05 22:18:54,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:54,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:18:54,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:54,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:54,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:54,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:54,598 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:54,604 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:54,610 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:54,616 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,904 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:18:54,905 INFO L628 ElimStorePlain]: treesize reduction 355, result has 48.2 percent of original size [2021-06-05 22:18:54,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:54,910 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:54,916 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:54,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:54,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:18:54,921 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:55,132 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 22:18:55,132 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:18:55,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:55,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:55,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:55,138 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:55,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:55,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:55,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:55,144 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:55,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:55,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:55,149 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:55,251 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-06-05 22:18:55,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:18:55,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:18:55,258 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:231 [2021-06-05 22:18:55,562 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2021-06-05 22:18:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:55,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890808435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:55,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:18:55,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:18:55,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578964237] [2021-06-05 22:18:55,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:18:55,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:18:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:18:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:18:55,886 INFO L87 Difference]: Start difference. First operand 342 states and 984 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:56,349 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 22:18:56,631 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2021-06-05 22:18:57,079 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2021-06-05 22:18:57,660 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 131 [2021-06-05 22:18:57,870 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-06-05 22:18:58,108 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2021-06-05 22:18:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:18:58,120 INFO L93 Difference]: Finished difference Result 505 states and 1412 transitions. [2021-06-05 22:18:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:18:58,120 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:18:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:18:58,121 INFO L225 Difference]: With dead ends: 505 [2021-06-05 22:18:58,121 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 22:18:58,121 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2860.2ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:18:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 22:18:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 348. [2021-06-05 22:18:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.881844380403458) internal successors, (1000), 347 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1000 transitions. [2021-06-05 22:18:58,125 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1000 transitions. Word has length 20 [2021-06-05 22:18:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:18:58,125 INFO L482 AbstractCegarLoop]: Abstraction has 348 states and 1000 transitions. [2021-06-05 22:18:58,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:18:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1000 transitions. [2021-06-05 22:18:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:18:58,126 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:18:58,126 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:18:58,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 227 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3342 [2021-06-05 22:18:58,341 INFO L430 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:18:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:18:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -199525972, now seen corresponding path program 26 times [2021-06-05 22:18:58,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:18:58,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925534612] [2021-06-05 22:18:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:18:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:18:58,759 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-06-05 22:18:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:18:58,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:18:58,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925534612] [2021-06-05 22:18:58,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925534612] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:18:58,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497350804] [2021-06-05 22:18:58,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:18:58,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:18:58,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:18:58,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:18:58,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:18:59,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:18:59,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:59,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:59,531 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:59,538 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:18:59,544 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:18:59,551 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,931 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-06-05 22:18:59,931 INFO L628 ElimStorePlain]: treesize reduction 449, result has 46.5 percent of original size [2021-06-05 22:18:59,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:18:59,937 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:59,943 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:18:59,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:18:59,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:18:59,948 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,251 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 22:19:00,251 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:19:00,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:00,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:00,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:00,257 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:00,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:00,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:00,264 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:00,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:00,269 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,545 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 22:19:00,545 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:19:00,551 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:00,551 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:955, output treesize:293 [2021-06-05 22:19:00,703 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:19:00,925 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_570, get_6, v_prenex_560, v_prenex_550, v_prenex_562, v_prenex_552, v_prenex_564, v_prenex_554, v_prenex_566, v_prenex_556, v_prenex_568, v_prenex_546, v_prenex_558, v_prenex_548], 1=[v_prenex_561, v_prenex_572, v_prenex_551, v_prenex_563, v_prenex_553, v_prenex_565, get_0, v_prenex_555, v_prenex_567, v_prenex_557, v_prenex_569, v_prenex_547, v_prenex_559, v_prenex_549]} [2021-06-05 22:19:00,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:19:00,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 22:19:00,951 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:00,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:19:00,963 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:01,457 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 101 [2021-06-05 22:19:01,458 INFO L628 ElimStorePlain]: treesize reduction 1048, result has 24.9 percent of original size [2021-06-05 22:19:01,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:01,464 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:01,611 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:19:01,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:01,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:19:01,617 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:01,757 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:19:01,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:01,758 INFO L518 ElimStorePlain]: Eliminatee v_prenex_550 vanished before elimination [2021-06-05 22:19:01,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:01,764 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:01,901 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 22:19:01,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:01,902 INFO L518 ElimStorePlain]: Eliminatee v_prenex_552 vanished before elimination [2021-06-05 22:19:01,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:19:01,908 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:02,044 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:19:02,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:02,045 INFO L518 ElimStorePlain]: Eliminatee v_prenex_554 vanished before elimination [2021-06-05 22:19:02,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:02,050 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:02,184 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 22:19:02,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:02,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_556 vanished before elimination [2021-06-05 22:19:02,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_568 vanished before elimination [2021-06-05 22:19:02,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_546 vanished before elimination [2021-06-05 22:19:02,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:02,190 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:02,325 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:19:02,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:02,325 INFO L518 ElimStorePlain]: Eliminatee v_prenex_548 vanished before elimination [2021-06-05 22:19:02,325 INFO L518 ElimStorePlain]: Eliminatee v_prenex_561 vanished before elimination [2021-06-05 22:19:02,325 INFO L518 ElimStorePlain]: Eliminatee v_prenex_572 vanished before elimination [2021-06-05 22:19:02,325 INFO L518 ElimStorePlain]: Eliminatee v_prenex_551 vanished before elimination [2021-06-05 22:19:02,325 INFO L518 ElimStorePlain]: Eliminatee v_prenex_563 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_553 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_565 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_555 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_567 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_557 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_569 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_547 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_559 vanished before elimination [2021-06-05 22:19:02,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_549 vanished before elimination [2021-06-05 22:19:02,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:19:02,329 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 42 variables, input treesize:1485, output treesize:253 [2021-06-05 22:19:02,465 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:19:02,656 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-06-05 22:19:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:02,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497350804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:02,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:02,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:02,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271609596] [2021-06-05 22:19:02,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:02,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:02,745 INFO L87 Difference]: Start difference. First operand 348 states and 1000 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:03,235 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 22:19:03,554 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 22:19:04,080 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2021-06-05 22:19:04,467 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2021-06-05 22:19:04,905 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2021-06-05 22:19:05,451 WARN L205 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 106 [2021-06-05 22:19:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:05,466 INFO L93 Difference]: Finished difference Result 526 states and 1455 transitions. [2021-06-05 22:19:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:05,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:05,467 INFO L225 Difference]: With dead ends: 526 [2021-06-05 22:19:05,467 INFO L226 Difference]: Without dead ends: 505 [2021-06-05 22:19:05,467 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3543.4ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-06-05 22:19:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 351. [2021-06-05 22:19:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 2.88) internal successors, (1008), 350 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1008 transitions. [2021-06-05 22:19:05,471 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1008 transitions. Word has length 20 [2021-06-05 22:19:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:05,472 INFO L482 AbstractCegarLoop]: Abstraction has 351 states and 1008 transitions. [2021-06-05 22:19:05,472 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1008 transitions. [2021-06-05 22:19:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:05,472 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:05,472 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:05,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3429,228 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:05,689 INFO L430 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1898246360, now seen corresponding path program 27 times [2021-06-05 22:19:05,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:05,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830854943] [2021-06-05 22:19:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:06,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:06,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830854943] [2021-06-05 22:19:06,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830854943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:06,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428941373] [2021-06-05 22:19:06,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:06,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:19:06,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:06,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:19:06,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:06,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:06,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:06,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:06,790 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-06-05 22:19:06,790 INFO L628 ElimStorePlain]: treesize reduction 171, result has 67.2 percent of original size [2021-06-05 22:19:06,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:06,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:06,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:06,934 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 22:19:06,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:06,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:06,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:06,940 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,076 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:19:07,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:07,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:07,083 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:07,089 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,216 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:19:07,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:07,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:07,223 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:07,228 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,349 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:19:07,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:07,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:07,356 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:07,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:07,362 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:07,467 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:19:07,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:07,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:07,474 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 22:19:07,693 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 22:19:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:08,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428941373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:08,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:08,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:08,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995829516] [2021-06-05 22:19:08,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:08,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:08,149 INFO L87 Difference]: Start difference. First operand 351 states and 1008 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:08,627 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 22:19:08,933 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2021-06-05 22:19:09,402 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2021-06-05 22:19:09,691 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2021-06-05 22:19:10,103 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2021-06-05 22:19:10,579 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2021-06-05 22:19:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:10,604 INFO L93 Difference]: Finished difference Result 503 states and 1413 transitions. [2021-06-05 22:19:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:10,605 INFO L225 Difference]: With dead ends: 503 [2021-06-05 22:19:10,605 INFO L226 Difference]: Without dead ends: 488 [2021-06-05 22:19:10,606 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3044.8ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-06-05 22:19:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 345. [2021-06-05 22:19:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 2.883720930232558) internal successors, (992), 344 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 992 transitions. [2021-06-05 22:19:10,609 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 992 transitions. Word has length 20 [2021-06-05 22:19:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:10,609 INFO L482 AbstractCegarLoop]: Abstraction has 345 states and 992 transitions. [2021-06-05 22:19:10,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 992 transitions. [2021-06-05 22:19:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:10,610 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:10,610 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:10,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3550 [2021-06-05 22:19:10,810 INFO L430 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash 335703830, now seen corresponding path program 28 times [2021-06-05 22:19:10,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:10,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384458161] [2021-06-05 22:19:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:11,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:11,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384458161] [2021-06-05 22:19:11,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384458161] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:11,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039991286] [2021-06-05 22:19:11,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:11,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:19:11,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:11,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:19:11,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:11,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:11,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:11,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,238 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2021-06-05 22:19:12,238 INFO L628 ElimStorePlain]: treesize reduction 189, result has 68.2 percent of original size [2021-06-05 22:19:12,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:12,245 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,420 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:19:12,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:12,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:12,426 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,599 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:19:12,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:12,607 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:12,613 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,770 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:19:12,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:12,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:12,776 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:12,782 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,928 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:19:12,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:12,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:12,934 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:12,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:12,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:12,940 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:13,080 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:19:13,081 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:13,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:13,088 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:601, output treesize:295 [2021-06-05 22:19:13,352 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 22:19:14,092 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_614, v_prenex_616, v_prenex_606, get_6, v_prenex_608, v_prenex_610, v_prenex_612], 1=[v_prenex_613, get_3, v_prenex_615, v_prenex_605, v_prenex_607, v_prenex_609, v_prenex_611]} [2021-06-05 22:19:14,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:19:14,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:19:14,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:14,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:19:14,136 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 22:19:14,146 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:19:14,157 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,750 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 106 [2021-06-05 22:19:14,750 INFO L628 ElimStorePlain]: treesize reduction 1859, result has 17.5 percent of original size [2021-06-05 22:19:14,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:19:14,757 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:14,924 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:19:14,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:14,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:14,931 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:15,098 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 22:19:15,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:15,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:19:15,105 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:15,272 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:19:15,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:15,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:15,279 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:15,438 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:19:15,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:15,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:15,445 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:15,602 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:19:15,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:15,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:19:15,607 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:15,758 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 22:19:15,759 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_613 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_615 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_605 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_607 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_609 vanished before elimination [2021-06-05 22:19:15,759 INFO L518 ElimStorePlain]: Eliminatee v_prenex_611 vanished before elimination [2021-06-05 22:19:15,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:19:15,765 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2437, output treesize:292 [2021-06-05 22:19:15,918 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 22:19:16,127 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2021-06-05 22:19:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:16,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039991286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:16,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:16,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:16,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452606459] [2021-06-05 22:19:16,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:16,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:16,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:16,253 INFO L87 Difference]: Start difference. First operand 345 states and 992 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:16,726 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2021-06-05 22:19:17,019 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2021-06-05 22:19:17,449 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 132 [2021-06-05 22:19:17,844 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2021-06-05 22:19:18,284 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2021-06-05 22:19:18,807 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2021-06-05 22:19:18,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:18,822 INFO L93 Difference]: Finished difference Result 533 states and 1470 transitions. [2021-06-05 22:19:18,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:18,822 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:18,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:18,823 INFO L225 Difference]: With dead ends: 533 [2021-06-05 22:19:18,823 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 22:19:18,823 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3472.2ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 22:19:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 351. [2021-06-05 22:19:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 2.88) internal successors, (1008), 350 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1008 transitions. [2021-06-05 22:19:18,827 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1008 transitions. Word has length 20 [2021-06-05 22:19:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:18,827 INFO L482 AbstractCegarLoop]: Abstraction has 351 states and 1008 transitions. [2021-06-05 22:19:18,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1008 transitions. [2021-06-05 22:19:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:18,827 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:18,827 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:19,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3646,230 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:19,028 INFO L430 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1363016558, now seen corresponding path program 29 times [2021-06-05 22:19:19,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:19,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513172327] [2021-06-05 22:19:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:19,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:19,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513172327] [2021-06-05 22:19:19,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513172327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:19,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137736573] [2021-06-05 22:19:19,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:19,364 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:19:19,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:19,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:19:19,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:19,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:19,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:19,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:19,591 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:19,595 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:19,599 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:19,604 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:19,608 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:19,612 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:19,616 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:19,620 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:19,624 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:19,628 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:19,633 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:19,637 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:19,641 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:19,645 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:19,649 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:19,652 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:19,782 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 22:19:19,782 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 22:19:19,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:19:19,784 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 22:19:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:20,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137736573] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:20,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:20,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:19:20,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395956895] [2021-06-05 22:19:20,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:19:20,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:19:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:19:20,127 INFO L87 Difference]: Start difference. First operand 351 states and 1008 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:20,810 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2021-06-05 22:19:21,283 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2021-06-05 22:19:21,411 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-06-05 22:19:21,668 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2021-06-05 22:19:21,825 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 22:19:22,047 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-06-05 22:19:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:22,140 INFO L93 Difference]: Finished difference Result 647 states and 1743 transitions. [2021-06-05 22:19:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 22:19:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:22,141 INFO L225 Difference]: With dead ends: 647 [2021-06-05 22:19:22,141 INFO L226 Difference]: Without dead ends: 617 [2021-06-05 22:19:22,142 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2378.2ms TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:19:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-06-05 22:19:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 348. [2021-06-05 22:19:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.881844380403458) internal successors, (1000), 347 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1000 transitions. [2021-06-05 22:19:22,146 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1000 transitions. Word has length 20 [2021-06-05 22:19:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:22,146 INFO L482 AbstractCegarLoop]: Abstraction has 348 states and 1000 transitions. [2021-06-05 22:19:22,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1000 transitions. [2021-06-05 22:19:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:22,146 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:22,146 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:22,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3854 [2021-06-05 22:19:22,347 INFO L430 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1536264250, now seen corresponding path program 30 times [2021-06-05 22:19:22,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:22,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802325968] [2021-06-05 22:19:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:22,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:22,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802325968] [2021-06-05 22:19:22,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802325968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:22,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613777813] [2021-06-05 22:19:22,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:22,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:19:22,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:22,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:19:22,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:23,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:23,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:23,081 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:23,088 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:23,094 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:23,101 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:23,108 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,392 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:19:23,393 INFO L628 ElimStorePlain]: treesize reduction 345, result has 47.6 percent of original size [2021-06-05 22:19:23,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:23,398 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:23,404 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:23,409 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,529 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 22:19:23,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:23,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:23,535 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:23,540 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:23,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:23,545 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:23,758 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 22:19:23,758 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:19:23,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:23,764 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:246 [2021-06-05 22:19:24,084 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2021-06-05 22:19:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:24,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613777813] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:24,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:24,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:24,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796182424] [2021-06-05 22:19:24,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:24,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:24,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:24,372 INFO L87 Difference]: Start difference. First operand 348 states and 1000 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:24,842 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 22:19:25,140 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 22:19:25,526 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 125 [2021-06-05 22:19:26,161 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 129 [2021-06-05 22:19:26,417 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 22:19:26,744 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 22:19:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:26,770 INFO L93 Difference]: Finished difference Result 507 states and 1420 transitions. [2021-06-05 22:19:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:26,770 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:26,771 INFO L225 Difference]: With dead ends: 507 [2021-06-05 22:19:26,771 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 22:19:26,771 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2888.8ms TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 22:19:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 342. [2021-06-05 22:19:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.8856304985337244) internal successors, (984), 341 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 984 transitions. [2021-06-05 22:19:26,775 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 984 transitions. Word has length 20 [2021-06-05 22:19:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:26,775 INFO L482 AbstractCegarLoop]: Abstraction has 342 states and 984 transitions. [2021-06-05 22:19:26,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 984 transitions. [2021-06-05 22:19:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:26,775 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:26,775 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:26,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3884,232 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:26,976 INFO L430 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1281321126, now seen corresponding path program 31 times [2021-06-05 22:19:26,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:26,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812052475] [2021-06-05 22:19:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:27,272 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-06-05 22:19:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:27,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:27,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812052475] [2021-06-05 22:19:27,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812052475] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:27,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582681743] [2021-06-05 22:19:27,492 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:27,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:19:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:27,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:27,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:27,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:27,863 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:27,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:27,869 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:27,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:27,875 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:27,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:27,881 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:27,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:27,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:27,885 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,133 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 22:19:28,134 INFO L628 ElimStorePlain]: treesize reduction 299, result has 47.1 percent of original size [2021-06-05 22:19:28,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:28,138 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:28,144 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:28,149 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:28,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:28,251 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:28,256 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:28,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:28,261 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:28,426 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 22:19:28,426 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 22:19:28,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:28,432 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:191 [2021-06-05 22:19:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:29,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582681743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:29,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:29,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:29,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114513551] [2021-06-05 22:19:29,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:29,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:29,252 INFO L87 Difference]: Start difference. First operand 342 states and 984 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:29,790 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2021-06-05 22:19:30,346 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 128 [2021-06-05 22:19:31,245 WARN L205 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 136 [2021-06-05 22:19:32,221 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 143 [2021-06-05 22:19:33,290 WARN L205 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 152 [2021-06-05 22:19:34,486 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 201 DAG size of output: 159 [2021-06-05 22:19:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:34,521 INFO L93 Difference]: Finished difference Result 639 states and 1741 transitions. [2021-06-05 22:19:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:34,521 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:34,522 INFO L225 Difference]: With dead ends: 639 [2021-06-05 22:19:34,522 INFO L226 Difference]: Without dead ends: 624 [2021-06-05 22:19:34,522 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6009.7ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-06-05 22:19:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 344. [2021-06-05 22:19:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.8979591836734695) internal successors, (994), 343 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 994 transitions. [2021-06-05 22:19:34,526 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 994 transitions. Word has length 20 [2021-06-05 22:19:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:34,527 INFO L482 AbstractCegarLoop]: Abstraction has 344 states and 994 transitions. [2021-06-05 22:19:34,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 994 transitions. [2021-06-05 22:19:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:34,527 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:34,527 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:34,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3954 [2021-06-05 22:19:34,727 INFO L430 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash 884403472, now seen corresponding path program 32 times [2021-06-05 22:19:34,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:34,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522844342] [2021-06-05 22:19:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:35,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:35,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522844342] [2021-06-05 22:19:35,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522844342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:35,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918103961] [2021-06-05 22:19:35,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:35,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:19:35,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:19:35,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:35,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,509 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:35,520 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:35,525 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,530 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:19:35,535 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,540 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:35,545 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:35,549 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,554 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:19:35,559 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,563 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:35,568 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:19:35,572 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:19:35,577 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:35,582 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,586 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:19:35,591 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,595 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:19:35,600 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:19:35,604 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:35,609 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,613 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:35,618 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:35,622 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:35,626 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,630 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:35,635 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,639 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,643 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,647 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,651 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:19:35,655 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:19:35,660 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:35,664 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:35,668 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:35,844 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 22:19:35,844 INFO L628 ElimStorePlain]: treesize reduction 324, result has 38.5 percent of original size [2021-06-05 22:19:35,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:19:35,846 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1765, output treesize:203 [2021-06-05 22:19:36,230 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-06-05 22:19:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:36,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918103961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:36,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:36,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:36,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177833971] [2021-06-05 22:19:36,727 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:36,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:36,727 INFO L87 Difference]: Start difference. First operand 344 states and 994 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:36,989 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 22:19:37,471 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 22:19:37,976 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2021-06-05 22:19:38,608 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2021-06-05 22:19:39,359 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2021-06-05 22:19:40,209 WARN L205 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2021-06-05 22:19:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:40,227 INFO L93 Difference]: Finished difference Result 651 states and 1778 transitions. [2021-06-05 22:19:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:40,228 INFO L225 Difference]: With dead ends: 651 [2021-06-05 22:19:40,228 INFO L226 Difference]: Without dead ends: 636 [2021-06-05 22:19:40,229 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4607.5ms TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:19:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-06-05 22:19:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 352. [2021-06-05 22:19:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 2.9145299145299144) internal successors, (1023), 351 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1023 transitions. [2021-06-05 22:19:40,233 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1023 transitions. Word has length 20 [2021-06-05 22:19:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:40,233 INFO L482 AbstractCegarLoop]: Abstraction has 352 states and 1023 transitions. [2021-06-05 22:19:40,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1023 transitions. [2021-06-05 22:19:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:40,234 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:40,234 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:40,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 234 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4023 [2021-06-05 22:19:40,434 INFO L430 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash -814316916, now seen corresponding path program 33 times [2021-06-05 22:19:40,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:40,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204806202] [2021-06-05 22:19:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:40,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:40,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204806202] [2021-06-05 22:19:40,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204806202] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:40,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195286674] [2021-06-05 22:19:40,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:40,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:19:40,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:40,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:19:40,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:41,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:41,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:41,185 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:19:41,191 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:19:41,197 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:41,202 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:41,206 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,467 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 22:19:41,468 INFO L628 ElimStorePlain]: treesize reduction 354, result has 45.5 percent of original size [2021-06-05 22:19:41,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:41,473 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:41,478 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:41,498 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,689 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:19:41,689 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:19:41,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:41,694 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:19:41,699 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:41,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:41,703 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:41,862 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 22:19:41,862 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 22:19:41,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:41,868 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:191 [2021-06-05 22:19:42,322 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:19:42,714 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:19:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:42,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195286674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:42,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:42,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:42,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515180607] [2021-06-05 22:19:42,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:42,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:42,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:42,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:42,892 INFO L87 Difference]: Start difference. First operand 352 states and 1023 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:43,448 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2021-06-05 22:19:44,028 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 137 [2021-06-05 22:19:44,626 WARN L205 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 133 [2021-06-05 22:19:45,583 WARN L205 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 146 [2021-06-05 22:19:46,648 WARN L205 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 151 [2021-06-05 22:19:47,812 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 216 DAG size of output: 158 [2021-06-05 22:19:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:19:47,843 INFO L93 Difference]: Finished difference Result 658 states and 1794 transitions. [2021-06-05 22:19:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:19:47,843 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:19:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:19:47,844 INFO L225 Difference]: With dead ends: 658 [2021-06-05 22:19:47,844 INFO L226 Difference]: Without dead ends: 643 [2021-06-05 22:19:47,844 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5683.9ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:19:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-05 22:19:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 355. [2021-06-05 22:19:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 2.9293785310734464) internal successors, (1037), 354 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1037 transitions. [2021-06-05 22:19:47,849 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1037 transitions. Word has length 20 [2021-06-05 22:19:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:19:47,849 INFO L482 AbstractCegarLoop]: Abstraction has 355 states and 1037 transitions. [2021-06-05 22:19:47,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1037 transitions. [2021-06-05 22:19:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:19:47,849 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:19:47,849 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:19:48,050 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 235 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4051 [2021-06-05 22:19:48,050 INFO L430 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:19:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:19:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -987564608, now seen corresponding path program 34 times [2021-06-05 22:19:48,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:19:48,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801857515] [2021-06-05 22:19:48,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:19:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:19:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:48,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:19:48,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801857515] [2021-06-05 22:19:48,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801857515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:48,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359135264] [2021-06-05 22:19:48,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:19:48,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:19:48,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:19:48,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:19:48,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:19:48,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:48,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:48,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,256 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2021-06-05 22:19:49,257 INFO L628 ElimStorePlain]: treesize reduction 173, result has 67.4 percent of original size [2021-06-05 22:19:49,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:49,263 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,412 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 22:19:49,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:49,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:49,419 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:49,425 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,571 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:19:49,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:49,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:49,578 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:49,583 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,716 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:19:49,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:49,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:19:49,723 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:49,728 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,845 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:19:49,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:49,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:19:49,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:19:49,851 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:49,966 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:19:49,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:49,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:19:49,972 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:537, output treesize:247 [2021-06-05 22:19:50,176 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2021-06-05 22:19:50,423 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2021-06-05 22:19:50,650 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:19:50,918 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2021-06-05 22:19:51,531 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_702, v_prenex_704, v_prenex_690, v_prenex_706, get_6, v_prenex_692, v_prenex_694, v_prenex_696, v_prenex_698, v_prenex_700], 1=[v_prenex_701, get_3, v_prenex_703, v_prenex_705, v_prenex_691, v_prenex_693, v_prenex_695, v_prenex_697, v_prenex_699, v_prenex_689]} [2021-06-05 22:19:51,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:51,542 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:51,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:19:51,552 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:51,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:19:51,563 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:51,914 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 79 [2021-06-05 22:19:51,915 INFO L628 ElimStorePlain]: treesize reduction 737, result has 29.1 percent of original size [2021-06-05 22:19:51,915 INFO L518 ElimStorePlain]: Eliminatee v_prenex_704 vanished before elimination [2021-06-05 22:19:51,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:51,920 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:52,036 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 22:19:52,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:52,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:52,042 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:52,155 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 22:19:52,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:52,155 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 22:19:52,155 INFO L518 ElimStorePlain]: Eliminatee v_prenex_692 vanished before elimination [2021-06-05 22:19:52,155 INFO L518 ElimStorePlain]: Eliminatee v_prenex_694 vanished before elimination [2021-06-05 22:19:52,155 INFO L518 ElimStorePlain]: Eliminatee v_prenex_696 vanished before elimination [2021-06-05 22:19:52,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:19:52,160 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:52,271 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 22:19:52,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:52,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:19:52,277 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:19:52,385 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-06-05 22:19:52,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:19:52,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_701 vanished before elimination [2021-06-05 22:19:52,385 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:19:52,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_703 vanished before elimination [2021-06-05 22:19:52,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_705 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_691 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_693 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_695 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_697 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_699 vanished before elimination [2021-06-05 22:19:52,386 INFO L518 ElimStorePlain]: Eliminatee v_prenex_689 vanished before elimination [2021-06-05 22:19:52,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 20 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:19:52,389 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 30 variables, input treesize:1152, output treesize:237 [2021-06-05 22:19:52,602 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-06-05 22:19:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:19:52,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359135264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:19:52,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:19:52,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:19:52,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50778006] [2021-06-05 22:19:52,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:19:52,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:19:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:19:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:19:52,747 INFO L87 Difference]: Start difference. First operand 355 states and 1037 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:19:53,425 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 131 [2021-06-05 22:19:54,250 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 141 [2021-06-05 22:19:54,600 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 52 [2021-06-05 22:19:55,461 WARN L205 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 146 [2021-06-05 22:19:55,939 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 112 [2021-06-05 22:19:57,144 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 224 DAG size of output: 169 [2021-06-05 22:19:57,558 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2021-06-05 22:19:58,621 WARN L205 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 166 [2021-06-05 22:19:58,907 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2021-06-05 22:20:00,109 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 220 DAG size of output: 179 [2021-06-05 22:20:00,356 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-06-05 22:20:00,558 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-05 22:20:00,736 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-06-05 22:20:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:00,782 INFO L93 Difference]: Finished difference Result 931 states and 2503 transitions. [2021-06-05 22:20:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 22:20:00,783 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:00,783 INFO L225 Difference]: With dead ends: 931 [2021-06-05 22:20:00,784 INFO L226 Difference]: Without dead ends: 792 [2021-06-05 22:20:00,784 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 8929.7ms TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:20:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-06-05 22:20:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 381. [2021-06-05 22:20:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.9789473684210526) internal successors, (1132), 380 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1132 transitions. [2021-06-05 22:20:00,789 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1132 transitions. Word has length 20 [2021-06-05 22:20:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:00,789 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1132 transitions. [2021-06-05 22:20:00,789 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1132 transitions. [2021-06-05 22:20:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:00,789 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:00,789 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:00,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4130,236 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:00,990 INFO L430 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:00,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:00,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1985393222, now seen corresponding path program 35 times [2021-06-05 22:20:00,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:00,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955857904] [2021-06-05 22:20:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:01,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:01,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955857904] [2021-06-05 22:20:01,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955857904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:01,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070782252] [2021-06-05 22:20:01,366 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:01,395 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:20:01,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:01,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:01,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:01,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:01,525 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:01,530 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:01,534 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:01,538 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,542 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,547 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:01,551 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:01,556 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,560 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:01,565 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:01,569 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,573 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,578 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,582 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,586 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:01,591 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,595 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,599 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,603 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:01,608 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:01,612 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:01,616 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:01,620 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,624 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:01,628 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:20:01,632 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,636 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:01,640 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,645 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:01,649 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:01,653 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:01,657 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:20:01,661 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:01,665 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:01,673 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:01,805 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 22:20:01,805 INFO L628 ElimStorePlain]: treesize reduction 268, result has 35.7 percent of original size [2021-06-05 22:20:01,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:20:01,806 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:20:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:02,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070782252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:02,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:02,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:20:02,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997213738] [2021-06-05 22:20:02,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:20:02,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:20:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:20:02,297 INFO L87 Difference]: Start difference. First operand 381 states and 1132 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:02,747 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2021-06-05 22:20:03,090 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2021-06-05 22:20:03,498 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2021-06-05 22:20:03,895 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 96 [2021-06-05 22:20:04,376 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 103 [2021-06-05 22:20:04,927 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 110 [2021-06-05 22:20:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:04,957 INFO L93 Difference]: Finished difference Result 637 states and 1762 transitions. [2021-06-05 22:20:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:20:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:04,959 INFO L225 Difference]: With dead ends: 637 [2021-06-05 22:20:04,959 INFO L226 Difference]: Without dead ends: 622 [2021-06-05 22:20:04,959 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3141.3ms TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:20:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-06-05 22:20:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 385. [2021-06-05 22:20:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.984375) internal successors, (1146), 384 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1146 transitions. [2021-06-05 22:20:04,966 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1146 transitions. Word has length 20 [2021-06-05 22:20:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:04,966 INFO L482 AbstractCegarLoop]: Abstraction has 385 states and 1146 transitions. [2021-06-05 22:20:04,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1146 transitions. [2021-06-05 22:20:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:04,966 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:04,967 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:05,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 237 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4282 [2021-06-05 22:20:05,181 INFO L430 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash -809196446, now seen corresponding path program 36 times [2021-06-05 22:20:05,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:05,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072463934] [2021-06-05 22:20:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:05,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:05,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072463934] [2021-06-05 22:20:05,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072463934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:05,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851345467] [2021-06-05 22:20:05,717 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:05,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:20:05,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:05,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:06,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:06,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:06,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:06,036 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:06,041 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:06,047 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:06,051 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,295 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-06-05 22:20:06,295 INFO L628 ElimStorePlain]: treesize reduction 308, result has 48.4 percent of original size [2021-06-05 22:20:06,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:06,301 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:06,305 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:06,310 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,486 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 22:20:06,487 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:20:06,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:06,492 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:06,496 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:06,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:06,500 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:06,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:06,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:20:06,589 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:190 [2021-06-05 22:20:06,877 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2021-06-05 22:20:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:07,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851345467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:07,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:07,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:07,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375560629] [2021-06-05 22:20:07,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:07,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:07,482 INFO L87 Difference]: Start difference. First operand 385 states and 1146 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:08,060 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 119 [2021-06-05 22:20:08,603 WARN L205 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 130 [2021-06-05 22:20:08,796 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-06-05 22:20:09,081 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2021-06-05 22:20:09,628 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 142 [2021-06-05 22:20:09,895 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2021-06-05 22:20:10,606 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 157 [2021-06-05 22:20:10,917 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2021-06-05 22:20:11,280 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2021-06-05 22:20:11,506 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-06-05 22:20:12,248 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 166 [2021-06-05 22:20:12,769 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 144 [2021-06-05 22:20:13,155 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2021-06-05 22:20:14,410 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 227 DAG size of output: 175 [2021-06-05 22:20:14,989 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 147 [2021-06-05 22:20:15,905 WARN L205 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 189 [2021-06-05 22:20:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:15,916 INFO L93 Difference]: Finished difference Result 722 states and 2088 transitions. [2021-06-05 22:20:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 22:20:15,916 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:15,917 INFO L225 Difference]: With dead ends: 722 [2021-06-05 22:20:15,917 INFO L226 Difference]: Without dead ends: 707 [2021-06-05 22:20:15,918 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 8781.9ms TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 22:20:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-06-05 22:20:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 389. [2021-06-05 22:20:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.9948453608247423) internal successors, (1162), 388 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1162 transitions. [2021-06-05 22:20:15,923 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1162 transitions. Word has length 20 [2021-06-05 22:20:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:15,923 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1162 transitions. [2021-06-05 22:20:15,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1162 transitions. [2021-06-05 22:20:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:15,923 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:15,923 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:16,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4307,238 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:16,124 INFO L430 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1859986214, now seen corresponding path program 37 times [2021-06-05 22:20:16,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:16,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916972594] [2021-06-05 22:20:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:16,445 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:16,445 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916972594] [2021-06-05 22:20:16,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916972594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:16,445 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799190325] [2021-06-05 22:20:16,445 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:16,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:16,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:16,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:16,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,604 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,608 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:16,612 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:16,616 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:16,621 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:16,625 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,629 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,633 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,637 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,641 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,645 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:16,650 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,654 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:16,658 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:16,662 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:16,667 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:16,671 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,675 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,679 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,683 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:16,687 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,691 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:16,695 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:16,699 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:20:16,704 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:16,708 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:16,711 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,716 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:20:16,719 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:16,723 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,728 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:16,732 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:16,735 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:16,739 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:16,743 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:16,872 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2021-06-05 22:20:16,872 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 22:20:16,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:20:16,873 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:20:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:17,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799190325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:17,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:17,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:17,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697346132] [2021-06-05 22:20:17,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:17,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:17,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:17,397 INFO L87 Difference]: Start difference. First operand 389 states and 1162 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:17,849 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2021-06-05 22:20:18,201 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2021-06-05 22:20:18,561 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2021-06-05 22:20:19,126 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2021-06-05 22:20:20,014 WARN L205 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 101 [2021-06-05 22:20:20,975 WARN L205 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2021-06-05 22:20:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:20,998 INFO L93 Difference]: Finished difference Result 641 states and 1778 transitions. [2021-06-05 22:20:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:20:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:20,999 INFO L225 Difference]: With dead ends: 641 [2021-06-05 22:20:20,999 INFO L226 Difference]: Without dead ends: 626 [2021-06-05 22:20:20,999 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4032.3ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:20:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-06-05 22:20:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 389. [2021-06-05 22:20:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.9948453608247423) internal successors, (1162), 388 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1162 transitions. [2021-06-05 22:20:21,004 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1162 transitions. Word has length 20 [2021-06-05 22:20:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:21,004 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1162 transitions. [2021-06-05 22:20:21,004 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1162 transitions. [2021-06-05 22:20:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:21,004 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:21,004 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:21,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4410,239 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:21,205 INFO L430 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash 246419480, now seen corresponding path program 38 times [2021-06-05 22:20:21,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:21,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341243617] [2021-06-05 22:20:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:21,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:21,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341243617] [2021-06-05 22:20:21,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341243617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:21,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800110805] [2021-06-05 22:20:21,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:21,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:20:21,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:21,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:20:21,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:21,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:21,820 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:21,824 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,829 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:21,834 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,839 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:21,844 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:21,849 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,853 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:21,858 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,862 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:21,867 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:21,872 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:20:21,876 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:21,881 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,886 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:21,890 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,895 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:21,899 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:20:21,904 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:21,908 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,913 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:21,917 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:21,921 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:21,926 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,930 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:21,934 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,938 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,942 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,947 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,951 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:21,955 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:21,959 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:21,963 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:21,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:21,967 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:22,144 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 22:20:22,144 INFO L628 ElimStorePlain]: treesize reduction 324, result has 38.5 percent of original size [2021-06-05 22:20:22,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:20:22,146 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1765, output treesize:203 [2021-06-05 22:20:22,698 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-06-05 22:20:22,872 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 22:20:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:22,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800110805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:22,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:22,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:22,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826466092] [2021-06-05 22:20:22,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:22,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:22,992 INFO L87 Difference]: Start difference. First operand 389 states and 1162 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:23,274 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 22:20:23,726 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 22:20:24,186 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-06-05 22:20:24,764 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 22:20:25,382 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2021-06-05 22:20:26,082 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2021-06-05 22:20:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:26,102 INFO L93 Difference]: Finished difference Result 610 states and 1715 transitions. [2021-06-05 22:20:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:20:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:26,103 INFO L225 Difference]: With dead ends: 610 [2021-06-05 22:20:26,103 INFO L226 Difference]: Without dead ends: 595 [2021-06-05 22:20:26,103 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3994.8ms TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:20:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-06-05 22:20:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2021-06-05 22:20:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.9948453608247423) internal successors, (1162), 388 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1162 transitions. [2021-06-05 22:20:26,108 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1162 transitions. Word has length 20 [2021-06-05 22:20:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:26,108 INFO L482 AbstractCegarLoop]: Abstraction has 389 states and 1162 transitions. [2021-06-05 22:20:26,108 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1162 transitions. [2021-06-05 22:20:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:26,109 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:26,109 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:26,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4434,240 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:26,309 INFO L430 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash -492920346, now seen corresponding path program 39 times [2021-06-05 22:20:26,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:26,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606510186] [2021-06-05 22:20:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:26,768 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:26,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606510186] [2021-06-05 22:20:26,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606510186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:26,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023056780] [2021-06-05 22:20:26,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:26,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:20:26,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:26,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:27,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:27,067 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:27,073 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:27,078 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:27,084 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:27,105 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:27,112 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,364 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-06-05 22:20:27,364 INFO L628 ElimStorePlain]: treesize reduction 314, result has 47.9 percent of original size [2021-06-05 22:20:27,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:27,369 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:27,375 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:27,379 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,484 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-06-05 22:20:27,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:27,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:27,490 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:27,495 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:27,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:27,499 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:27,669 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 22:20:27,669 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 22:20:27,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:20:27,675 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:190 [2021-06-05 22:20:28,278 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 22:20:28,467 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 22:20:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:28,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023056780] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:28,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:28,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:28,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032116118] [2021-06-05 22:20:28,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:28,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:28,648 INFO L87 Difference]: Start difference. First operand 389 states and 1162 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:29,208 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2021-06-05 22:20:29,646 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2021-06-05 22:20:30,284 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 137 [2021-06-05 22:20:31,049 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 143 [2021-06-05 22:20:32,127 WARN L205 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 152 [2021-06-05 22:20:33,051 WARN L205 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 161 [2021-06-05 22:20:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:33,070 INFO L93 Difference]: Finished difference Result 690 states and 1908 transitions. [2021-06-05 22:20:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:20:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:33,071 INFO L225 Difference]: With dead ends: 690 [2021-06-05 22:20:33,071 INFO L226 Difference]: Without dead ends: 669 [2021-06-05 22:20:33,072 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 5195.1ms TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:20:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-06-05 22:20:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 393. [2021-06-05 22:20:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.010204081632653) internal successors, (1180), 392 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1180 transitions. [2021-06-05 22:20:33,076 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1180 transitions. Word has length 20 [2021-06-05 22:20:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:33,076 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1180 transitions. [2021-06-05 22:20:33,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1180 transitions. [2021-06-05 22:20:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:33,077 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:33,077 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:33,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 241 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4462 [2021-06-05 22:20:33,277 INFO L430 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1711555706, now seen corresponding path program 40 times [2021-06-05 22:20:33,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:33,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848935866] [2021-06-05 22:20:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:33,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:33,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848935866] [2021-06-05 22:20:33,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848935866] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:33,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085986469] [2021-06-05 22:20:33,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:33,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:20:33,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:33,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:33,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:34,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:34,058 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:34,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:34,071 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,314 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-06-05 22:20:34,314 INFO L628 ElimStorePlain]: treesize reduction 140, result has 67.9 percent of original size [2021-06-05 22:20:34,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:34,321 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:34,326 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,430 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:20:34,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:34,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:34,436 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,539 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:20:34,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:34,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:34,545 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:34,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:34,649 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:34,654 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:34,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:34,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:34,746 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:34,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:34,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:20:34,837 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 22:20:35,000 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:20:35,511 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 22:20:35,694 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 22:20:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:35,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085986469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:35,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:35,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:35,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247525759] [2021-06-05 22:20:35,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:35,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:35,883 INFO L87 Difference]: Start difference. First operand 393 states and 1180 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:36,475 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 125 [2021-06-05 22:20:37,339 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 129 [2021-06-05 22:20:37,520 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 22:20:38,163 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 139 [2021-06-05 22:20:38,994 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2021-06-05 22:20:39,909 WARN L205 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 153 [2021-06-05 22:20:40,906 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 164 [2021-06-05 22:20:41,812 WARN L205 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 157 [2021-06-05 22:20:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:41,824 INFO L93 Difference]: Finished difference Result 714 states and 2005 transitions. [2021-06-05 22:20:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 22:20:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:41,826 INFO L225 Difference]: With dead ends: 714 [2021-06-05 22:20:41,826 INFO L226 Difference]: Without dead ends: 699 [2021-06-05 22:20:41,826 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6652.4ms TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:20:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-06-05 22:20:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 393. [2021-06-05 22:20:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 3.010204081632653) internal successors, (1180), 392 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1180 transitions. [2021-06-05 22:20:41,831 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1180 transitions. Word has length 20 [2021-06-05 22:20:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:41,831 INFO L482 AbstractCegarLoop]: Abstraction has 393 states and 1180 transitions. [2021-06-05 22:20:41,831 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1180 transitions. [2021-06-05 22:20:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:41,831 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:41,831 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:42,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 242 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4541 [2021-06-05 22:20:42,032 INFO L430 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash 496140202, now seen corresponding path program 41 times [2021-06-05 22:20:42,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:42,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187557737] [2021-06-05 22:20:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:42,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:42,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187557737] [2021-06-05 22:20:42,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187557737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:42,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272116769] [2021-06-05 22:20:42,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:42,296 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:20:42,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:42,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:42,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:42,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:42,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:42,434 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,439 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:42,443 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:42,447 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:42,451 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:42,456 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,460 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,464 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,468 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,472 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:42,477 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,481 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:42,485 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:42,489 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:42,494 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:42,498 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,502 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:42,506 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,510 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,515 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:42,519 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,523 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,527 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,531 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:42,535 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:20:42,540 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,544 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:42,548 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:20:42,552 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:42,556 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,560 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:20:42,564 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:20:42,567 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:20:42,572 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:20:42,577 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:42,709 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 22:20:42,710 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 22:20:42,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:20:42,711 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:20:43,195 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:20:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:43,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272116769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:43,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:43,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:20:43,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278090978] [2021-06-05 22:20:43,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:20:43,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:43,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:20:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:20:43,376 INFO L87 Difference]: Start difference. First operand 393 states and 1180 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:43,629 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 22:20:44,066 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:20:44,306 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 22:20:44,759 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 22:20:44,936 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2021-06-05 22:20:45,293 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-06-05 22:20:45,535 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 22:20:45,917 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2021-06-05 22:20:46,190 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:20:46,970 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2021-06-05 22:20:47,237 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-06-05 22:20:47,509 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2021-06-05 22:20:47,792 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2021-06-05 22:20:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:47,793 INFO L93 Difference]: Finished difference Result 967 states and 2616 transitions. [2021-06-05 22:20:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 22:20:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:47,795 INFO L225 Difference]: With dead ends: 967 [2021-06-05 22:20:47,795 INFO L226 Difference]: Without dead ends: 931 [2021-06-05 22:20:47,795 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4808.7ms TimeCoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 22:20:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-06-05 22:20:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 400. [2021-06-05 22:20:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.037593984962406) internal successors, (1212), 399 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1212 transitions. [2021-06-05 22:20:47,801 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1212 transitions. Word has length 20 [2021-06-05 22:20:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:47,801 INFO L482 AbstractCegarLoop]: Abstraction has 400 states and 1212 transitions. [2021-06-05 22:20:47,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1212 transitions. [2021-06-05 22:20:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:47,801 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:47,801 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:48,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4612 [2021-06-05 22:20:48,002 INFO L430 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -674048794, now seen corresponding path program 42 times [2021-06-05 22:20:48,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:48,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311704036] [2021-06-05 22:20:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:48,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:48,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311704036] [2021-06-05 22:20:48,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311704036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:48,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877148832] [2021-06-05 22:20:48,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:48,444 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:20:48,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:20:48,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:20:48,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:48,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:48,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:48,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,340 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 22:20:49,340 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 22:20:49,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:49,347 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:49,353 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,517 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 22:20:49,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:49,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:49,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:49,529 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,687 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 22:20:49,687 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:49,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:49,694 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:49,700 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,843 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:20:49,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:49,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:49,849 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:49,989 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:20:49,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:49,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:49,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:49,994 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,136 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:20:50,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:50,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:20:50,144 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 22:20:50,369 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 22:20:50,561 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:20:50,842 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_790, v_prenex_792, v_prenex_794, v_prenex_784, v_prenex_786, v_prenex_788], 1=[v_prenex_789, get_3, v_prenex_791, v_prenex_793, v_prenex_783, v_prenex_785, v_prenex_787]} [2021-06-05 22:20:50,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:50,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:50,862 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:20:50,872 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:20:50,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:50,892 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:50,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:50,901 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:51,583 WARN L205 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 120 [2021-06-05 22:20:51,584 INFO L628 ElimStorePlain]: treesize reduction 1903, result has 18.0 percent of original size [2021-06-05 22:20:51,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:51,590 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:51,776 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 22:20:51,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:51,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:20:51,783 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:51,964 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 22:20:51,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:51,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:20:51,971 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:52,152 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 22:20:52,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:52,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:20:52,158 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:52,331 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:20:52,332 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:52,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:20:52,337 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:52,506 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:20:52,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:52,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:20:52,512 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:52,677 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:20:52,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_789 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_791 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_793 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_783 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_785 vanished before elimination [2021-06-05 22:20:52,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_787 vanished before elimination [2021-06-05 22:20:52,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:20:52,683 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2497, output treesize:328 [2021-06-05 22:20:52,984 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-06-05 22:20:53,589 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-06-05 22:20:53,847 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 22:20:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:53,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877148832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:53,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:20:53,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:20:53,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698361405] [2021-06-05 22:20:53,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:20:53,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:20:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:20:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:20:53,986 INFO L87 Difference]: Start difference. First operand 400 states and 1212 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:54,367 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-05 22:20:54,787 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 22:20:55,351 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 138 [2021-06-05 22:20:56,134 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 150 [2021-06-05 22:20:57,156 WARN L205 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 155 [2021-06-05 22:20:58,313 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 198 DAG size of output: 162 [2021-06-05 22:20:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:20:58,348 INFO L93 Difference]: Finished difference Result 712 states and 1984 transitions. [2021-06-05 22:20:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:20:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:20:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:20:58,349 INFO L225 Difference]: With dead ends: 712 [2021-06-05 22:20:58,349 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 22:20:58,350 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5912.2ms TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:20:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 22:20:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 397. [2021-06-05 22:20:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 3.032828282828283) internal successors, (1201), 396 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1201 transitions. [2021-06-05 22:20:58,355 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1201 transitions. Word has length 20 [2021-06-05 22:20:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:20:58,355 INFO L482 AbstractCegarLoop]: Abstraction has 397 states and 1201 transitions. [2021-06-05 22:20:58,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:20:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1201 transitions. [2021-06-05 22:20:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:20:58,356 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:20:58,356 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:20:58,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4639,244 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:58,556 INFO L430 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:20:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:20:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash -690985846, now seen corresponding path program 43 times [2021-06-05 22:20:58,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:20:58,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985721008] [2021-06-05 22:20:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:20:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:20:59,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:20:59,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985721008] [2021-06-05 22:20:59,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985721008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:20:59,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534023070] [2021-06-05 22:20:59,003 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:20:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:20:59,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:20:59,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:20:59,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:59,286 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:59,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:20:59,299 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,527 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2021-06-05 22:20:59,528 INFO L628 ElimStorePlain]: treesize reduction 106, result has 72.8 percent of original size [2021-06-05 22:20:59,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:20:59,534 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:59,539 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:59,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:59,641 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:59,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:59,740 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:59,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:59,841 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:20:59,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:20:59,936 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:20:59,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:20:59,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:20:59,941 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:00,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:00,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:00,033 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 22:21:00,196 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:21:00,696 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 22:21:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:00,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534023070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:00,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:00,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:00,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473239087] [2021-06-05 22:21:00,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:00,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:00,987 INFO L87 Difference]: Start difference. First operand 397 states and 1201 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:01,287 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2021-06-05 22:21:01,521 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2021-06-05 22:21:01,927 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 103 [2021-06-05 22:21:02,103 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 22:21:02,562 WARN L205 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2021-06-05 22:21:02,749 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 22:21:03,193 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 125 [2021-06-05 22:21:03,478 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-06-05 22:21:03,943 WARN L205 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 137 [2021-06-05 22:21:04,234 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 22:21:04,754 WARN L205 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 139 [2021-06-05 22:21:05,060 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2021-06-05 22:21:05,386 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2021-06-05 22:21:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:05,387 INFO L93 Difference]: Finished difference Result 972 states and 2626 transitions. [2021-06-05 22:21:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 22:21:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:05,389 INFO L225 Difference]: With dead ends: 972 [2021-06-05 22:21:05,389 INFO L226 Difference]: Without dead ends: 934 [2021-06-05 22:21:05,389 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5157.1ms TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:21:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-06-05 22:21:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 399. [2021-06-05 22:21:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 3.0351758793969847) internal successors, (1208), 398 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1208 transitions. [2021-06-05 22:21:05,395 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1208 transitions. Word has length 20 [2021-06-05 22:21:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:05,395 INFO L482 AbstractCegarLoop]: Abstraction has 399 states and 1208 transitions. [2021-06-05 22:21:05,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1208 transitions. [2021-06-05 22:21:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:05,396 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:05,396 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:05,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4795 [2021-06-05 22:21:05,596 INFO L430 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 449297990, now seen corresponding path program 44 times [2021-06-05 22:21:05,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:05,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372423523] [2021-06-05 22:21:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:06,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:06,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372423523] [2021-06-05 22:21:06,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372423523] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:06,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983532495] [2021-06-05 22:21:06,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:06,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:21:06,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:06,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:21:06,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:06,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:06,347 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:06,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:06,361 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,581 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2021-06-05 22:21:06,582 INFO L628 ElimStorePlain]: treesize reduction 98, result has 73.2 percent of original size [2021-06-05 22:21:06,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:06,587 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:06,593 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,693 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:21:06,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:06,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:06,699 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:06,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:06,804 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:06,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:06,907 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:06,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:06,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:06,912 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:07,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:07,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:07,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:07,006 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:07,092 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:07,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:07,098 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 22:21:07,260 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:21:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:08,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983532495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:08,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:08,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:08,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766482167] [2021-06-05 22:21:08,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:08,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:08,043 INFO L87 Difference]: Start difference. First operand 399 states and 1208 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:08,615 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 114 [2021-06-05 22:21:09,058 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 118 [2021-06-05 22:21:09,470 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 129 [2021-06-05 22:21:10,194 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 135 [2021-06-05 22:21:10,953 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 145 [2021-06-05 22:21:11,780 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 152 [2021-06-05 22:21:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:11,813 INFO L93 Difference]: Finished difference Result 717 states and 1995 transitions. [2021-06-05 22:21:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:21:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:11,814 INFO L225 Difference]: With dead ends: 717 [2021-06-05 22:21:11,814 INFO L226 Difference]: Without dead ends: 702 [2021-06-05 22:21:11,814 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4433.0ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:21:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-06-05 22:21:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 401. [2021-06-05 22:21:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.0375) internal successors, (1215), 400 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1215 transitions. [2021-06-05 22:21:11,819 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1215 transitions. Word has length 20 [2021-06-05 22:21:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:11,819 INFO L482 AbstractCegarLoop]: Abstraction has 401 states and 1215 transitions. [2021-06-05 22:21:11,819 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1215 transitions. [2021-06-05 22:21:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:11,819 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:11,820 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:12,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4865,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:12,020 INFO L430 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 341702684, now seen corresponding path program 45 times [2021-06-05 22:21:12,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:12,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420615722] [2021-06-05 22:21:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:12,281 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-06-05 22:21:12,415 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 22:21:12,545 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2021-06-05 22:21:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:12,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:12,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420615722] [2021-06-05 22:21:12,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420615722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:12,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257519837] [2021-06-05 22:21:12,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:12,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:21:12,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:12,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:21:12,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:13,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:13,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:13,325 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:13,332 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,677 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2021-06-05 22:21:13,678 INFO L628 ElimStorePlain]: treesize reduction 118, result has 75.6 percent of original size [2021-06-05 22:21:13,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:13,685 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:13,691 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,843 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 22:21:13,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:13,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:13,849 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:13,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:13,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:13,855 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:14,000 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:21:14,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:14,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:14,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:14,006 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:14,149 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:21:14,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:14,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:14,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:14,155 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:14,295 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:21:14,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:14,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:14,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:14,301 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:14,439 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:21:14,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:14,447 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:14,447 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 22:21:14,676 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 22:21:14,861 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:21:15,356 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2021-06-05 22:21:15,679 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_880, v_prenex_871, v_prenex_893, v_prenex_883, v_prenex_850, v_prenex_862, v_prenex_873, v_prenex_885, v_prenex_852, v_prenex_864, v_prenex_875, v_prenex_854, v_prenex_877, v_prenex_888, v_prenex_856, v_prenex_867, v_prenex_869, v_prenex_859, v_prenex_848], 1=[get_3, v_prenex_870, v_prenex_892, v_prenex_882, v_prenex_861, v_prenex_872, v_prenex_884, v_prenex_851, v_prenex_863, v_prenex_874, v_prenex_853, v_prenex_887, v_prenex_876, v_prenex_855, v_prenex_866, v_prenex_879, v_prenex_868, v_prenex_858, v_prenex_847, v_prenex_849]} [2021-06-05 22:21:15,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:15,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:15,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:15,723 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:15,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:15,745 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:16,555 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 149 [2021-06-05 22:21:16,556 INFO L628 ElimStorePlain]: treesize reduction 1613, result has 23.4 percent of original size [2021-06-05 22:21:16,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_880 vanished before elimination [2021-06-05 22:21:16,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_871 vanished before elimination [2021-06-05 22:21:16,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_893 vanished before elimination [2021-06-05 22:21:16,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_883 vanished before elimination [2021-06-05 22:21:16,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_850 vanished before elimination [2021-06-05 22:21:16,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:16,564 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:16,774 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2021-06-05 22:21:16,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:16,774 INFO L518 ElimStorePlain]: Eliminatee v_prenex_873 vanished before elimination [2021-06-05 22:21:16,774 INFO L518 ElimStorePlain]: Eliminatee v_prenex_885 vanished before elimination [2021-06-05 22:21:16,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:16,782 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:16,990 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 22:21:16,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:16,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:16,999 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:17,204 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 22:21:17,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:17,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_875 vanished before elimination [2021-06-05 22:21:17,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:17,212 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:17,419 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 22:21:17,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:17,420 INFO L518 ElimStorePlain]: Eliminatee v_prenex_877 vanished before elimination [2021-06-05 22:21:17,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:17,427 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:17,627 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-06-05 22:21:17,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:17,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:17,635 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:17,828 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-06-05 22:21:17,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:17,828 INFO L518 ElimStorePlain]: Eliminatee v_prenex_867 vanished before elimination [2021-06-05 22:21:17,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:17,835 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:18,028 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 22:21:18,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:18,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:18,034 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:18,223 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 22:21:18,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:18,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:18,230 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:18,415 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:21:18,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_870 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_892 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_882 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_861 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_872 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_884 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_851 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_863 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_874 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_853 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_887 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_876 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_855 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_866 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_879 vanished before elimination [2021-06-05 22:21:18,416 INFO L518 ElimStorePlain]: Eliminatee v_prenex_868 vanished before elimination [2021-06-05 22:21:18,417 INFO L518 ElimStorePlain]: Eliminatee v_prenex_858 vanished before elimination [2021-06-05 22:21:18,417 INFO L518 ElimStorePlain]: Eliminatee v_prenex_847 vanished before elimination [2021-06-05 22:21:18,417 INFO L518 ElimStorePlain]: Eliminatee v_prenex_849 vanished before elimination [2021-06-05 22:21:18,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 40 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:21:18,422 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 60 variables, input treesize:2201, output treesize:346 [2021-06-05 22:21:18,753 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 22:21:19,007 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 22:21:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:19,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257519837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:19,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:19,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:19,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652920254] [2021-06-05 22:21:19,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:19,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:19,162 INFO L87 Difference]: Start difference. First operand 401 states and 1215 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:19,633 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 135 [2021-06-05 22:21:20,280 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 139 [2021-06-05 22:21:21,497 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 241 DAG size of output: 184 [2021-06-05 22:21:22,396 WARN L205 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 162 [2021-06-05 22:21:22,684 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 59 [2021-06-05 22:21:23,722 WARN L205 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 177 [2021-06-05 22:21:23,948 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2021-06-05 22:21:24,132 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 57 [2021-06-05 22:21:24,576 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2021-06-05 22:21:25,735 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 242 DAG size of output: 184 [2021-06-05 22:21:26,048 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2021-06-05 22:21:26,415 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2021-06-05 22:21:26,563 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2021-06-05 22:21:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:26,622 INFO L93 Difference]: Finished difference Result 835 states and 2271 transitions. [2021-06-05 22:21:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 22:21:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:26,623 INFO L225 Difference]: With dead ends: 835 [2021-06-05 22:21:26,623 INFO L226 Difference]: Without dead ends: 772 [2021-06-05 22:21:26,623 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 8988.7ms TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2021-06-05 22:21:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-06-05 22:21:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 416. [2021-06-05 22:21:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.053012048192771) internal successors, (1267), 415 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1267 transitions. [2021-06-05 22:21:26,629 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1267 transitions. Word has length 20 [2021-06-05 22:21:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:26,629 INFO L482 AbstractCegarLoop]: Abstraction has 416 states and 1267 transitions. [2021-06-05 22:21:26,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1267 transitions. [2021-06-05 22:21:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:26,630 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:26,630 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:26,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4961,247 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:26,830 INFO L430 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash -828486312, now seen corresponding path program 46 times [2021-06-05 22:21:26,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:26,831 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563424791] [2021-06-05 22:21:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:27,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:27,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563424791] [2021-06-05 22:21:27,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563424791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:27,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927780101] [2021-06-05 22:21:27,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:27,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:21:27,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:27,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:21:27,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:27,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:27,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:27,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:27,706 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:27,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:27,723 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:27,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:27,733 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:27,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:27,742 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:27,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:27,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:27,750 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,026 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 22:21:28,026 INFO L628 ElimStorePlain]: treesize reduction 319, result has 48.5 percent of original size [2021-06-05 22:21:28,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:28,032 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:21:28,037 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:28,042 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,258 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 22:21:28,258 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:21:28,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:28,264 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:28,269 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:28,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:21:28,274 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:28,376 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-06-05 22:21:28,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:28,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:28,383 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:805, output treesize:225 [2021-06-05 22:21:28,832 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:21:29,576 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_940, v_prenex_930, v_prenex_920, v_prenex_932, v_prenex_910, v_prenex_922, v_prenex_912, v_prenex_924, v_prenex_914, v_prenex_926, v_prenex_916, v_prenex_928, v_prenex_918], 1=[get_3, v_prenex_931, v_prenex_921, v_prenex_911, v_prenex_923, v_prenex_913, v_prenex_925, v_prenex_915, v_prenex_927, v_prenex_939, v_prenex_917, v_prenex_929, v_prenex_919, v_prenex_909]} [2021-06-05 22:21:29,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:29,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,124 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 109 [2021-06-05 22:21:30,125 INFO L628 ElimStorePlain]: treesize reduction 1142, result has 24.2 percent of original size [2021-06-05 22:21:30,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:30,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,285 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 22:21:30,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:30,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:30,292 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,442 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:21:30,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:30,442 INFO L518 ElimStorePlain]: Eliminatee v_prenex_920 vanished before elimination [2021-06-05 22:21:30,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:30,449 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,594 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:21:30,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:30,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_910 vanished before elimination [2021-06-05 22:21:30,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:30,601 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,744 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:21:30,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:30,744 INFO L518 ElimStorePlain]: Eliminatee v_prenex_912 vanished before elimination [2021-06-05 22:21:30,744 INFO L518 ElimStorePlain]: Eliminatee v_prenex_924 vanished before elimination [2021-06-05 22:21:30,744 INFO L518 ElimStorePlain]: Eliminatee v_prenex_914 vanished before elimination [2021-06-05 22:21:30,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:30,750 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:30,889 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:21:30,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:30,890 INFO L518 ElimStorePlain]: Eliminatee v_prenex_916 vanished before elimination [2021-06-05 22:21:30,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:30,895 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:31,035 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 22:21:31,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:31,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:31,041 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:31,174 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:21:31,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_931 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_921 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_911 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_923 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_913 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_925 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_915 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_927 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_939 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_917 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_929 vanished before elimination [2021-06-05 22:21:31,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_919 vanished before elimination [2021-06-05 22:21:31,176 INFO L518 ElimStorePlain]: Eliminatee v_prenex_909 vanished before elimination [2021-06-05 22:21:31,179 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:21:31,179 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1513, output treesize:253 [2021-06-05 22:21:31,317 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:21:31,540 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:21:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:31,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927780101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:31,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:31,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:31,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834918178] [2021-06-05 22:21:31,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:31,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:31,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:31,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:31,679 INFO L87 Difference]: Start difference. First operand 416 states and 1267 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:32,390 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 118 [2021-06-05 22:21:33,004 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 122 [2021-06-05 22:21:33,991 WARN L205 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 143 [2021-06-05 22:21:34,829 WARN L205 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 146 [2021-06-05 22:21:35,772 WARN L205 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 155 [2021-06-05 22:21:36,811 WARN L205 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 168 [2021-06-05 22:21:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:36,851 INFO L93 Difference]: Finished difference Result 680 states and 1913 transitions. [2021-06-05 22:21:36,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:21:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:36,852 INFO L225 Difference]: With dead ends: 680 [2021-06-05 22:21:36,852 INFO L226 Difference]: Without dead ends: 665 [2021-06-05 22:21:36,852 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5999.0ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:21:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-06-05 22:21:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 413. [2021-06-05 22:21:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.0485436893203883) internal successors, (1256), 412 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1256 transitions. [2021-06-05 22:21:36,857 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1256 transitions. Word has length 20 [2021-06-05 22:21:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:36,857 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1256 transitions. [2021-06-05 22:21:36,857 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1256 transitions. [2021-06-05 22:21:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:36,857 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:36,857 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:37,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5120,248 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:37,058 INFO L430 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -574161018, now seen corresponding path program 47 times [2021-06-05 22:21:37,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:37,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338058183] [2021-06-05 22:21:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:37,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:37,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338058183] [2021-06-05 22:21:37,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338058183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:37,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767487927] [2021-06-05 22:21:37,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:37,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:21:37,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:37,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:21:37,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:37,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:21:37,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:37,687 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,691 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:37,695 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:37,700 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:21:37,704 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:21:37,708 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,712 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,716 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,721 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,725 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:21:37,729 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,733 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:37,738 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:21:37,742 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:37,746 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:37,751 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,755 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:21:37,759 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,763 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,767 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:37,771 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,775 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,779 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,784 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:21:37,788 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:21:37,793 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,798 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:21:37,803 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:21:37,808 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:37,812 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,817 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:21:37,822 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:21:37,826 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:21:37,831 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:21:37,835 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:37,969 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 22:21:37,969 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 22:21:37,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:21:37,971 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:21:38,329 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 22:21:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:38,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767487927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:38,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:38,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:21:38,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328608111] [2021-06-05 22:21:38,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:21:38,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:21:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:21:38,621 INFO L87 Difference]: Start difference. First operand 413 states and 1256 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:39,070 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 22:21:39,379 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2021-06-05 22:21:39,760 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2021-06-05 22:21:40,336 WARN L205 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2021-06-05 22:21:40,653 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-06-05 22:21:41,017 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2021-06-05 22:21:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:41,039 INFO L93 Difference]: Finished difference Result 653 states and 1854 transitions. [2021-06-05 22:21:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:21:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:41,040 INFO L225 Difference]: With dead ends: 653 [2021-06-05 22:21:41,040 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 22:21:41,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3131.5ms TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:21:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 22:21:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 413. [2021-06-05 22:21:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.0485436893203883) internal successors, (1256), 412 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1256 transitions. [2021-06-05 22:21:41,045 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1256 transitions. Word has length 20 [2021-06-05 22:21:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:41,045 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1256 transitions. [2021-06-05 22:21:41,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1256 transitions. [2021-06-05 22:21:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:41,046 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:41,046 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:41,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 249 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5285 [2021-06-05 22:21:41,246 INFO L430 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash 637711574, now seen corresponding path program 48 times [2021-06-05 22:21:41,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:41,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376209701] [2021-06-05 22:21:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:41,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:41,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376209701] [2021-06-05 22:21:41,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376209701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:41,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991811364] [2021-06-05 22:21:41,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:41,744 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:21:41,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:41,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 22:21:41,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:42,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2021-06-05 22:21:42,116 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2021-06-05 22:21:42,125 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 22:21:42,130 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 22:21:42,136 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 22:21:42,142 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 22:21:42,147 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,413 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:21:42,413 INFO L628 ElimStorePlain]: treesize reduction 354, result has 47.7 percent of original size [2021-06-05 22:21:42,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 22:21:42,419 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-06-05 22:21:42,423 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-06-05 22:21:42,428 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,539 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 22:21:42,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:42,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 22:21:42,545 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 22:21:42,550 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:42,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2021-06-05 22:21:42,554 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:42,746 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:21:42,747 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:21:42,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:42,753 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:901, output treesize:236 [2021-06-05 22:21:43,041 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:21:43,547 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 127 [2021-06-05 22:21:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:44,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991811364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:44,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:44,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:44,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083376708] [2021-06-05 22:21:44,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:44,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:44,800 INFO L87 Difference]: Start difference. First operand 413 states and 1256 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:45,419 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 119 [2021-06-05 22:21:45,893 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 123 [2021-06-05 22:21:46,744 WARN L205 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 163 [2021-06-05 22:21:47,336 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 146 [2021-06-05 22:21:48,004 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 156 [2021-06-05 22:21:48,815 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 170 [2021-06-05 22:21:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:48,837 INFO L93 Difference]: Finished difference Result 676 states and 1901 transitions. [2021-06-05 22:21:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:21:48,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:48,838 INFO L225 Difference]: With dead ends: 676 [2021-06-05 22:21:48,838 INFO L226 Difference]: Without dead ends: 661 [2021-06-05 22:21:48,838 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4989.3ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:21:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-06-05 22:21:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 417. [2021-06-05 22:21:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.0576923076923075) internal successors, (1272), 416 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1272 transitions. [2021-06-05 22:21:48,845 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1272 transitions. Word has length 20 [2021-06-05 22:21:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:48,845 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1272 transitions. [2021-06-05 22:21:48,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1272 transitions. [2021-06-05 22:21:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:48,846 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:48,846 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:49,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5310 [2021-06-05 22:21:49,065 INFO L430 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1777995410, now seen corresponding path program 49 times [2021-06-05 22:21:49,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:49,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318852459] [2021-06-05 22:21:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:49,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:49,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318852459] [2021-06-05 22:21:49,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318852459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:49,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815850556] [2021-06-05 22:21:49,416 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:49,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:21:49,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:49,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:49,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:49,708 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,008 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2021-06-05 22:21:50,008 INFO L628 ElimStorePlain]: treesize reduction 164, result has 66.8 percent of original size [2021-06-05 22:21:50,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:50,014 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,146 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 22:21:50,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:50,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:50,159 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:50,164 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,293 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 22:21:50,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:50,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:50,300 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:50,305 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,420 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:21:50,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:50,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:50,425 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,540 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:21:50,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:50,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:50,546 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:50,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:50,551 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:50,656 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 22:21:50,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:50,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:21:50,663 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:501, output treesize:220 [2021-06-05 22:21:50,844 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2021-06-05 22:21:51,917 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_988, v_prenex_978, get_6, v_prenex_980, v_prenex_982, v_prenex_984, v_prenex_986], 1=[v_prenex_987, get_3, v_prenex_977, v_prenex_979, v_prenex_981, v_prenex_983, v_prenex_985]} [2021-06-05 22:21:51,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:51,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:51,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:21:51,949 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:51,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:21:51,965 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:51,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:21:51,982 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:52,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:21:52,003 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:52,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:52,018 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:52,590 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 103 [2021-06-05 22:21:52,590 INFO L628 ElimStorePlain]: treesize reduction 1770, result has 16.8 percent of original size [2021-06-05 22:21:52,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:52,597 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:52,748 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:21:52,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:52,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:52,760 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:52,911 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:21:52,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:52,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:52,918 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:53,064 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:21:53,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:53,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:21:53,070 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:53,213 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:21:53,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:53,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:21:53,220 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:53,363 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:21:53,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:53,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:21:53,371 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:53,512 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:21:53,512 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_987 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_977 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_979 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_981 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_983 vanished before elimination [2021-06-05 22:21:53,512 INFO L518 ElimStorePlain]: Eliminatee v_prenex_985 vanished before elimination [2021-06-05 22:21:53,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:21:53,516 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 22:21:53,655 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:21:53,866 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:21:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:54,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815850556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:54,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:21:54,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:21:54,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051433185] [2021-06-05 22:21:54,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:21:54,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:21:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:21:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:21:54,014 INFO L87 Difference]: Start difference. First operand 417 states and 1272 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:54,661 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2021-06-05 22:21:55,146 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2021-06-05 22:21:55,745 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 131 [2021-06-05 22:21:56,258 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 139 [2021-06-05 22:21:57,174 WARN L205 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 155 [2021-06-05 22:21:57,868 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 166 [2021-06-05 22:21:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:21:57,900 INFO L93 Difference]: Finished difference Result 683 states and 1919 transitions. [2021-06-05 22:21:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:21:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:21:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:21:57,901 INFO L225 Difference]: With dead ends: 683 [2021-06-05 22:21:57,901 INFO L226 Difference]: Without dead ends: 668 [2021-06-05 22:21:57,901 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4607.5ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:21:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-06-05 22:21:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 415. [2021-06-05 22:21:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.050724637681159) internal successors, (1263), 414 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1263 transitions. [2021-06-05 22:21:57,906 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1263 transitions. Word has length 20 [2021-06-05 22:21:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:21:57,906 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1263 transitions. [2021-06-05 22:21:57,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:21:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1263 transitions. [2021-06-05 22:21:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:21:57,907 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:21:57,907 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:21:58,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 251 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5552 [2021-06-05 22:21:58,107 INFO L430 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:21:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:21:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -997933088, now seen corresponding path program 50 times [2021-06-05 22:21:58,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:21:58,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640372780] [2021-06-05 22:21:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:21:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:21:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:21:58,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:21:58,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640372780] [2021-06-05 22:21:58,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640372780] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:21:58,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828885535] [2021-06-05 22:21:58,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:21:58,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:21:58,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:21:58,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:21:58,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:21:58,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:58,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:58,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,323 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 22:21:59,324 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 22:21:59,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:59,330 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,501 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:21:59,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:59,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:59,508 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,681 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:21:59,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:59,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:21:59,688 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:59,700 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,859 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:21:59,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:21:59,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:21:59,866 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:21:59,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:21:59,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:21:59,872 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:00,019 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:22:00,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:00,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:00,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:00,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:00,025 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:00,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:00,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:00,031 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:00,170 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:22:00,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:00,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:00,177 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 22:22:00,409 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 22:22:00,600 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:22:00,794 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 22:22:01,206 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2021-06-05 22:22:01,469 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1020, v_prenex_1041, get_6, v_prenex_1010, v_prenex_1032, v_prenex_1035, v_prenex_1012, v_prenex_1023, v_prenex_1015, v_prenex_1003, v_prenex_1025, v_prenex_1005, v_prenex_1027, v_prenex_1008, v_prenex_1018, v_prenex_1029], 1=[get_3, v_prenex_1040, v_prenex_1031, v_prenex_1011, v_prenex_1022, v_prenex_1002, v_prenex_1024, v_prenex_1034, v_prenex_1004, v_prenex_1026, v_prenex_1014, v_prenex_1017, v_prenex_1028, v_prenex_1019, v_prenex_1007, v_prenex_1009]} [2021-06-05 22:22:01,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:01,485 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,067 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 125 [2021-06-05 22:22:02,067 INFO L628 ElimStorePlain]: treesize reduction 1329, result has 22.6 percent of original size [2021-06-05 22:22:02,067 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1041 vanished before elimination [2021-06-05 22:22:02,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:22:02,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,233 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 22:22:02,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:02,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:02,241 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,398 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:22:02,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:02,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:02,405 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,554 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 22:22:02,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:02,555 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1035 vanished before elimination [2021-06-05 22:22:02,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:02,561 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,709 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 22:22:02,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:02,709 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1023 vanished before elimination [2021-06-05 22:22:02,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:02,715 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:02,861 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:22:02,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:02,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:02,868 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:03,011 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 22:22:03,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:03,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:03,018 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:03,160 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:22:03,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:03,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:03,166 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:03,305 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:22:03,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:03,305 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1027 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1008 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1018 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1029 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1040 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1031 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1011 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1022 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1002 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1024 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1034 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1004 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1026 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1014 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1017 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1028 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1019 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1007 vanished before elimination [2021-06-05 22:22:03,306 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1009 vanished before elimination [2021-06-05 22:22:03,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 32 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 22:22:03,310 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 48 variables, input treesize:1723, output treesize:276 [2021-06-05 22:22:03,538 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 22:22:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:03,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828885535] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:03,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:03,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:03,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003463493] [2021-06-05 22:22:03,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:03,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:03,684 INFO L87 Difference]: Start difference. First operand 415 states and 1263 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:04,092 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-05 22:22:04,649 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 22:22:04,808 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 22:22:05,387 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 140 [2021-06-05 22:22:05,610 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2021-06-05 22:22:06,510 WARN L205 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 175 [2021-06-05 22:22:06,749 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2021-06-05 22:22:07,228 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2021-06-05 22:22:07,357 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-06-05 22:22:07,916 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-06-05 22:22:08,069 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-06-05 22:22:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:08,090 INFO L93 Difference]: Finished difference Result 800 states and 2241 transitions. [2021-06-05 22:22:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:22:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:08,092 INFO L225 Difference]: With dead ends: 800 [2021-06-05 22:22:08,092 INFO L226 Difference]: Without dead ends: 770 [2021-06-05 22:22:08,092 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5407.3ms TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2021-06-05 22:22:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-06-05 22:22:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 417. [2021-06-05 22:22:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.0528846153846154) internal successors, (1270), 416 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1270 transitions. [2021-06-05 22:22:08,097 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1270 transitions. Word has length 20 [2021-06-05 22:22:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:08,097 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1270 transitions. [2021-06-05 22:22:08,097 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1270 transitions. [2021-06-05 22:22:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:08,098 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:08,098 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:08,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5724 [2021-06-05 22:22:08,298 INFO L430 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -426176046, now seen corresponding path program 51 times [2021-06-05 22:22:08,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:08,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017973056] [2021-06-05 22:22:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:08,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:08,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017973056] [2021-06-05 22:22:08,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017973056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:08,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66571504] [2021-06-05 22:22:08,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:08,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:22:08,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:08,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:22:08,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:09,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:09,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:09,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:09,158 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:09,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:09,164 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:09,514 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2021-06-05 22:22:09,515 INFO L628 ElimStorePlain]: treesize reduction 170, result has 69.4 percent of original size [2021-06-05 22:22:09,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:09,520 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:09,688 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-06-05 22:22:09,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:09,694 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:09,856 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 22:22:09,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:09,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:09,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:09,862 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:10,020 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 22:22:10,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:10,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:10,027 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:10,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:10,032 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:10,181 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 22:22:10,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:10,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:10,188 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:10,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:10,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:10,193 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:10,326 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:22:10,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:10,334 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:10,334 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:585, output treesize:279 [2021-06-05 22:22:10,572 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 102 [2021-06-05 22:22:11,136 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 89 [2021-06-05 22:22:12,143 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1070, v_prenex_1073, v_prenex_1063, get_6, v_prenex_1065, v_prenex_1067], 1=[v_prenex_1071, v_prenex_1064, v_prenex_1074, v_prenex_1066, v_prenex_1068, get_0]} [2021-06-05 22:22:12,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:12,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:12,168 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:12,181 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:22:12,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:12,206 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:22:12,219 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,669 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 93 [2021-06-05 22:22:12,670 INFO L628 ElimStorePlain]: treesize reduction 1515, result has 15.4 percent of original size [2021-06-05 22:22:12,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:12,676 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,782 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:22:12,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:12,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:12,788 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:12,892 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 22:22:12,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:12,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:12,898 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:13,001 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:22:13,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:13,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:13,007 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:13,108 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:22:13,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:13,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:22:13,113 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:13,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1071 vanished before elimination [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1064 vanished before elimination [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1074 vanished before elimination [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1066 vanished before elimination [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1068 vanished before elimination [2021-06-05 22:22:13,211 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:22:13,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:22:13,215 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:1959, output treesize:187 [2021-06-05 22:22:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:13,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66571504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:13,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:13,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:13,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651238223] [2021-06-05 22:22:13,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:13,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:13,424 INFO L87 Difference]: Start difference. First operand 417 states and 1270 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:13,987 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-06-05 22:22:14,405 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 136 [2021-06-05 22:22:15,241 WARN L205 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 149 [2021-06-05 22:22:16,284 WARN L205 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 193 [2021-06-05 22:22:16,621 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2021-06-05 22:22:17,002 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2021-06-05 22:22:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:17,016 INFO L93 Difference]: Finished difference Result 588 states and 1719 transitions. [2021-06-05 22:22:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:22:17,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:17,017 INFO L225 Difference]: With dead ends: 588 [2021-06-05 22:22:17,017 INFO L226 Difference]: Without dead ends: 561 [2021-06-05 22:22:17,017 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4627.8ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:22:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-06-05 22:22:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 421. [2021-06-05 22:22:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.057142857142857) internal successors, (1284), 420 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1284 transitions. [2021-06-05 22:22:17,022 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1284 transitions. Word has length 20 [2021-06-05 22:22:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:17,022 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1284 transitions. [2021-06-05 22:22:17,022 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1284 transitions. [2021-06-05 22:22:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:17,022 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:17,022 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:17,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5847,253 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:17,223 INFO L430 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash -633183728, now seen corresponding path program 52 times [2021-06-05 22:22:17,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:17,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701444198] [2021-06-05 22:22:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:17,618 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-06-05 22:22:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:17,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:17,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701444198] [2021-06-05 22:22:17,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701444198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:17,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357875018] [2021-06-05 22:22:17,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:17,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:22:17,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:17,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:22:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:17,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:17,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:22:17,965 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:17,970 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:17,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:17,981 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:17,986 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:17,991 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:17,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:17,996 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,001 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:22:18,007 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:18,012 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:18,017 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,022 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:22:18,027 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:22:18,032 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,037 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:18,042 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,048 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,053 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,058 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:18,063 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,080 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:18,086 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,091 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:18,096 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:18,101 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,106 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,111 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:18,116 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,121 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,126 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:18,131 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:18,135 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,140 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:18,145 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:18,149 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:18,335 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 22:22:18,335 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 22:22:18,337 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:22:18,337 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:22:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:18,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357875018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:18,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:18,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:18,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177143398] [2021-06-05 22:22:18,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:18,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:18,865 INFO L87 Difference]: Start difference. First operand 421 states and 1284 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:19,501 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 22:22:19,899 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2021-06-05 22:22:20,165 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 22:22:20,552 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 22:22:21,040 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2021-06-05 22:22:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:21,054 INFO L93 Difference]: Finished difference Result 628 states and 1790 transitions. [2021-06-05 22:22:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:22:21,054 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:21,055 INFO L225 Difference]: With dead ends: 628 [2021-06-05 22:22:21,055 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 22:22:21,055 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2902.4ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:22:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 22:22:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 423. [2021-06-05 22:22:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.059241706161137) internal successors, (1291), 422 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1291 transitions. [2021-06-05 22:22:21,060 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1291 transitions. Word has length 20 [2021-06-05 22:22:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:21,060 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1291 transitions. [2021-06-05 22:22:21,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1291 transitions. [2021-06-05 22:22:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:21,060 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:21,060 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:21,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6123,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:21,261 INFO L430 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1851819088, now seen corresponding path program 53 times [2021-06-05 22:22:21,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:21,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286034167] [2021-06-05 22:22:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:21,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:21,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286034167] [2021-06-05 22:22:21,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286034167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:21,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082170665] [2021-06-05 22:22:21,608 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:21,638 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:22:21,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:21,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 22:22:21,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:21,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:21,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:21,827 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:21,832 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:21,837 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,842 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:21,847 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:21,853 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,858 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:21,863 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,868 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:22:21,873 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:22:21,879 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,884 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:21,889 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:22:21,895 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,900 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:21,905 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,910 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,915 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:22:21,920 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:21,926 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:22:21,931 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,935 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,948 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,952 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:21,957 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,962 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:21,967 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:21,973 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,977 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:21,982 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,986 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:21,990 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:22:21,995 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:21,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:21,999 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:22,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:22,003 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:22,209 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-06-05 22:22:22,209 INFO L628 ElimStorePlain]: treesize reduction 357, result has 39.2 percent of original size [2021-06-05 22:22:22,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:22:22,211 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1873, output treesize:230 [2021-06-05 22:22:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:22,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082170665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:22,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:22,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:22:22,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141040748] [2021-06-05 22:22:22,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:22:22,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:22:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:22:22,844 INFO L87 Difference]: Start difference. First operand 423 states and 1291 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:23,514 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2021-06-05 22:22:24,146 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2021-06-05 22:22:24,342 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 22:22:24,590 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-06-05 22:22:24,840 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2021-06-05 22:22:25,051 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-06-05 22:22:25,415 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 22:22:25,706 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 22:22:26,194 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 22:22:26,754 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2021-06-05 22:22:26,935 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2021-06-05 22:22:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:26,936 INFO L93 Difference]: Finished difference Result 718 states and 2026 transitions. [2021-06-05 22:22:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:22:26,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:26,937 INFO L225 Difference]: With dead ends: 718 [2021-06-05 22:22:26,937 INFO L226 Difference]: Without dead ends: 673 [2021-06-05 22:22:26,937 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4524.3ms TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 22:22:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-06-05 22:22:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 432. [2021-06-05 22:22:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.062645011600928) internal successors, (1320), 431 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1320 transitions. [2021-06-05 22:22:26,942 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1320 transitions. Word has length 20 [2021-06-05 22:22:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:26,942 INFO L482 AbstractCegarLoop]: Abstraction has 432 states and 1320 transitions. [2021-06-05 22:22:26,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1320 transitions. [2021-06-05 22:22:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:26,943 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:26,943 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:27,143 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6153 [2021-06-05 22:22:27,143 INFO L430 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 169929870, now seen corresponding path program 54 times [2021-06-05 22:22:27,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:27,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678527987] [2021-06-05 22:22:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:27,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:27,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678527987] [2021-06-05 22:22:27,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678527987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:27,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22811407] [2021-06-05 22:22:27,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:27,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:22:27,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:27,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:22:27,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:27,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:27,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:27,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:27,848 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:27,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:27,854 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:27,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:27,860 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:27,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:27,866 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:27,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:27,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:27,871 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,163 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-06-05 22:22:28,164 INFO L628 ElimStorePlain]: treesize reduction 343, result has 47.0 percent of original size [2021-06-05 22:22:28,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:28,169 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:28,174 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:28,179 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,404 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 22:22:28,404 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:22:28,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:28,410 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:28,415 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:28,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:28,419 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:28,528 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-06-05 22:22:28,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:28,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:28,535 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:236 [2021-06-05 22:22:28,998 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2021-06-05 22:22:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:29,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22811407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:29,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:29,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:29,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680084139] [2021-06-05 22:22:29,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:29,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:29,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:29,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:29,336 INFO L87 Difference]: Start difference. First operand 432 states and 1320 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:30,157 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 118 [2021-06-05 22:22:30,834 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 133 [2021-06-05 22:22:31,595 WARN L205 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 143 [2021-06-05 22:22:31,798 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2021-06-05 22:22:32,028 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2021-06-05 22:22:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:32,041 INFO L93 Difference]: Finished difference Result 606 states and 1772 transitions. [2021-06-05 22:22:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:22:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:32,042 INFO L225 Difference]: With dead ends: 606 [2021-06-05 22:22:32,042 INFO L226 Difference]: Without dead ends: 579 [2021-06-05 22:22:32,042 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3268.3ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:22:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-06-05 22:22:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 435. [2021-06-05 22:22:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 3.0599078341013826) internal successors, (1328), 434 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1328 transitions. [2021-06-05 22:22:32,046 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1328 transitions. Word has length 20 [2021-06-05 22:22:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:32,046 INFO L482 AbstractCegarLoop]: Abstraction has 435 states and 1328 transitions. [2021-06-05 22:22:32,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1328 transitions. [2021-06-05 22:22:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:32,047 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:32,047 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:32,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6191,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:32,247 INFO L430 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash -146181486, now seen corresponding path program 55 times [2021-06-05 22:22:32,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:32,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254118503] [2021-06-05 22:22:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:32,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:32,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254118503] [2021-06-05 22:22:32,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254118503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:32,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803891004] [2021-06-05 22:22:32,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:32,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:22:32,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:32,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:32,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:32,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:32,941 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:32,948 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:32,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:32,954 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:32,960 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:32,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:32,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:32,973 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,305 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-06-05 22:22:33,306 INFO L628 ElimStorePlain]: treesize reduction 361, result has 48.4 percent of original size [2021-06-05 22:22:33,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:33,311 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:22:33,316 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:33,321 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,585 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 22:22:33,585 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:22:33,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:33,591 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:33,596 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:33,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:33,600 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:33,726 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-06-05 22:22:33,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:33,733 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:33,734 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:895, output treesize:263 [2021-06-05 22:22:34,831 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1109, get_6, v_prenex_1111, v_prenex_1113, v_prenex_1115, v_prenex_1107, v_prenex_1117], 1=[v_prenex_1108, v_prenex_1110, v_prenex_1112, v_prenex_1114, v_prenex_1116, get_0, v_prenex_1118]} [2021-06-05 22:22:34,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:22:34,846 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:34,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 22:22:34,872 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:34,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:34,883 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:34,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:22:34,893 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:34,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 22:22:34,903 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:34,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 22:22:34,913 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:35,488 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 102 [2021-06-05 22:22:35,489 INFO L628 ElimStorePlain]: treesize reduction 1757, result has 16.8 percent of original size [2021-06-05 22:22:35,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:35,495 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:35,649 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:22:35,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:35,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:22:35,655 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:35,804 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:22:35,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:35,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:35,811 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:35,956 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:22:35,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:35,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:35,962 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:36,112 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:22:36,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:36,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:22:36,117 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:36,256 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 22:22:36,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:36,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:36,262 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:36,399 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 22:22:36,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1108 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1110 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1112 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1114 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1116 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:22:36,400 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1118 vanished before elimination [2021-06-05 22:22:36,403 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:22:36,403 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 22:22:36,542 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 22:22:36,763 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 22:22:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:36,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803891004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:36,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:36,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:36,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597860481] [2021-06-05 22:22:36,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:36,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:36,944 INFO L87 Difference]: Start difference. First operand 435 states and 1328 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:37,496 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2021-06-05 22:22:37,879 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 131 [2021-06-05 22:22:38,639 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 147 [2021-06-05 22:22:39,010 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2021-06-05 22:22:39,426 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87 [2021-06-05 22:22:39,957 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 98 [2021-06-05 22:22:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:39,973 INFO L93 Difference]: Finished difference Result 627 states and 1815 transitions. [2021-06-05 22:22:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:22:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:39,974 INFO L225 Difference]: With dead ends: 627 [2021-06-05 22:22:39,974 INFO L226 Difference]: Without dead ends: 606 [2021-06-05 22:22:39,974 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3704.6ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:22:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-06-05 22:22:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 438. [2021-06-05 22:22:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.05720823798627) internal successors, (1336), 437 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1336 transitions. [2021-06-05 22:22:39,979 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1336 transitions. Word has length 20 [2021-06-05 22:22:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:39,979 INFO L482 AbstractCegarLoop]: Abstraction has 438 states and 1336 transitions. [2021-06-05 22:22:39,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1336 transitions. [2021-06-05 22:22:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:39,979 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:39,979 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:40,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6260 [2021-06-05 22:22:40,182 INFO L430 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1844901874, now seen corresponding path program 56 times [2021-06-05 22:22:40,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:40,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128658242] [2021-06-05 22:22:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:40,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:40,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128658242] [2021-06-05 22:22:40,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128658242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:40,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700297337] [2021-06-05 22:22:40,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:40,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:22:40,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:40,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:22:40,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:41,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:41,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:41,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:41,359 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:41,365 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:41,372 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:22:41,377 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,738 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-06-05 22:22:41,738 INFO L628 ElimStorePlain]: treesize reduction 401, result has 48.4 percent of original size [2021-06-05 22:22:41,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:41,745 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:41,751 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:41,757 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,921 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 22:22:41,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:41,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:41,927 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:41,932 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:41,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:41,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:41,937 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:42,218 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2021-06-05 22:22:42,219 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:22:42,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:42,225 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:985, output treesize:304 [2021-06-05 22:22:42,375 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:22:42,638 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:22:43,090 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1172, v_prenex_1160, v_prenex_1163, v_prenex_1141, v_prenex_1154, v_prenex_1156, v_prenex_1145, v_prenex_1166, v_prenex_1158, v_prenex_1149, v_prenex_1137, v_prenex_1139], 1=[v_prenex_1150, v_prenex_1161, v_prenex_1140, v_prenex_1173, v_prenex_1164, v_prenex_1142, v_prenex_1167, v_prenex_1155, v_prenex_1157, v_prenex_1146, v_prenex_1138, v_prenex_1159]} [2021-06-05 22:22:43,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:43,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:43,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:22:43,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:43,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:43,125 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:43,606 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 98 [2021-06-05 22:22:43,606 INFO L628 ElimStorePlain]: treesize reduction 920, result has 28.9 percent of original size [2021-06-05 22:22:43,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:22:43,612 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:43,764 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:22:43,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:43,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:43,770 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:43,922 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:22:43,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:43,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:43,928 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:44,079 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:22:44,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:44,079 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1154 vanished before elimination [2021-06-05 22:22:44,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:44,085 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:44,233 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:22:44,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:44,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:22:44,239 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:44,394 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 22:22:44,395 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1166 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1158 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1149 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1137 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1139 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1150 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1161 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1140 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1173 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1164 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1142 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1167 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1155 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1157 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1146 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1138 vanished before elimination [2021-06-05 22:22:44,395 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1159 vanished before elimination [2021-06-05 22:22:44,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 24 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:22:44,400 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 36 variables, input treesize:1407, output treesize:283 [2021-06-05 22:22:44,554 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 22:22:44,757 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 22:22:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:44,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700297337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:44,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:44,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:44,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587016860] [2021-06-05 22:22:44,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:44,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:44,853 INFO L87 Difference]: Start difference. First operand 438 states and 1336 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:45,450 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 139 [2021-06-05 22:22:46,652 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 203 DAG size of output: 183 [2021-06-05 22:22:47,053 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2021-06-05 22:22:47,448 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2021-06-05 22:22:47,752 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2021-06-05 22:22:48,041 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-06-05 22:22:48,258 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 22:22:48,893 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2021-06-05 22:22:49,133 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2021-06-05 22:22:49,908 WARN L205 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2021-06-05 22:22:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:49,936 INFO L93 Difference]: Finished difference Result 693 states and 1985 transitions. [2021-06-05 22:22:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:22:49,937 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:49,937 INFO L225 Difference]: With dead ends: 693 [2021-06-05 22:22:49,937 INFO L226 Difference]: Without dead ends: 576 [2021-06-05 22:22:49,938 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 6029.0ms TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:22:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-06-05 22:22:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 432. [2021-06-05 22:22:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.0603248259860787) internal successors, (1319), 431 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1319 transitions. [2021-06-05 22:22:49,942 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1319 transitions. Word has length 20 [2021-06-05 22:22:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:49,942 INFO L482 AbstractCegarLoop]: Abstraction has 432 states and 1319 transitions. [2021-06-05 22:22:49,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1319 transitions. [2021-06-05 22:22:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:49,943 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:49,943 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:50,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6439,258 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:50,157 INFO L430 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1265307084, now seen corresponding path program 57 times [2021-06-05 22:22:50,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:50,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909590704] [2021-06-05 22:22:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:50,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:50,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909590704] [2021-06-05 22:22:50,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909590704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:50,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395493312] [2021-06-05 22:22:50,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:50,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:22:50,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:50,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:22:50,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:50,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:50,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:50,753 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:50,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:50,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:50,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:22:50,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:50,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:50,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:50,765 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,049 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2021-06-05 22:22:51,050 INFO L628 ElimStorePlain]: treesize reduction 114, result has 74.2 percent of original size [2021-06-05 22:22:51,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:51,055 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,193 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:22:51,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:51,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:51,200 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,334 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:22:51,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:51,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:51,341 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:51,347 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,477 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:22:51,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:51,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:51,484 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:51,490 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,611 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 22:22:51,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:51,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:51,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:51,616 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:51,728 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 22:22:51,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:51,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:51,735 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 22:22:51,949 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:22:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:52,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395493312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:52,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:52,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:52,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446584685] [2021-06-05 22:22:52,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:52,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:52,506 INFO L87 Difference]: Start difference. First operand 432 states and 1319 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:52,991 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2021-06-05 22:22:53,333 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-06-05 22:22:53,779 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 22:22:54,316 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-06-05 22:22:54,468 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-06-05 22:22:54,916 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2021-06-05 22:22:55,071 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2021-06-05 22:22:55,279 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 22:22:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:22:55,279 INFO L93 Difference]: Finished difference Result 833 states and 2305 transitions. [2021-06-05 22:22:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 22:22:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:22:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:22:55,281 INFO L225 Difference]: With dead ends: 833 [2021-06-05 22:22:55,281 INFO L226 Difference]: Without dead ends: 797 [2021-06-05 22:22:55,281 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3212.9ms TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2021-06-05 22:22:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-05 22:22:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2021-06-05 22:22:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0888382687927107) internal successors, (1356), 439 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1356 transitions. [2021-06-05 22:22:55,287 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1356 transitions. Word has length 20 [2021-06-05 22:22:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:22:55,287 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1356 transitions. [2021-06-05 22:22:55,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1356 transitions. [2021-06-05 22:22:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:22:55,287 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:22:55,287 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:22:55,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 259 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6623 [2021-06-05 22:22:55,488 INFO L430 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:22:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:22:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 46671724, now seen corresponding path program 58 times [2021-06-05 22:22:55,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:22:55,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462505819] [2021-06-05 22:22:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:22:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:22:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:55,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:22:55,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462505819] [2021-06-05 22:22:55,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462505819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:55,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13441907] [2021-06-05 22:22:55,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:22:55,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:22:55,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:22:55,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:22:55,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:22:56,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:56,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,467 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2021-06-05 22:22:56,467 INFO L628 ElimStorePlain]: treesize reduction 170, result has 67.2 percent of original size [2021-06-05 22:22:56,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:56,473 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,613 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:22:56,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:56,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:56,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:56,625 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,757 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:22:56,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:56,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:56,762 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,892 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:22:56,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:56,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:22:56,898 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:56,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:56,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:56,903 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:57,027 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:22:57,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:57,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:57,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:57,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:22:57,033 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:57,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:22:57,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:22:57,038 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:22:57,146 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 22:22:57,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:22:57,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:22:57,153 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 22:22:57,378 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:22:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:22:57,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13441907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:22:57,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:22:57,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:22:57,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366306778] [2021-06-05 22:22:57,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:22:57,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:22:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:22:57,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:22:57,927 INFO L87 Difference]: Start difference. First operand 440 states and 1356 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:22:58,366 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2021-06-05 22:22:58,734 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 124 [2021-06-05 22:22:59,041 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 22:22:59,485 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2021-06-05 22:23:00,177 WARN L205 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2021-06-05 22:23:00,927 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2021-06-05 22:23:01,571 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2021-06-05 22:23:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:01,580 INFO L93 Difference]: Finished difference Result 729 states and 2070 transitions. [2021-06-05 22:23:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:23:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:01,581 INFO L225 Difference]: With dead ends: 729 [2021-06-05 22:23:01,581 INFO L226 Difference]: Without dead ends: 699 [2021-06-05 22:23:01,581 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4141.7ms TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2021-06-05 22:23:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-06-05 22:23:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 440. [2021-06-05 22:23:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0888382687927107) internal successors, (1356), 439 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1356 transitions. [2021-06-05 22:23:01,586 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1356 transitions. Word has length 20 [2021-06-05 22:23:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:01,586 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1356 transitions. [2021-06-05 22:23:01,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1356 transitions. [2021-06-05 22:23:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:01,587 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:01,587 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:01,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6718,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:01,787 INFO L430 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2040599664, now seen corresponding path program 59 times [2021-06-05 22:23:01,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:01,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179995269] [2021-06-05 22:23:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:02,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:02,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179995269] [2021-06-05 22:23:02,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179995269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:02,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523671613] [2021-06-05 22:23:02,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:02,184 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:23:02,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:02,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:23:02,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:02,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:02,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:23:02,361 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,365 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:02,370 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,374 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:02,380 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:23:02,385 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:02,389 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:02,394 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:02,399 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:02,403 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,408 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:23:02,412 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,417 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,421 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:23:02,426 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:02,431 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:23:02,435 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:02,439 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,444 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,448 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,452 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:23:02,457 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,462 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,466 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,470 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:02,475 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:23:02,479 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,484 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:02,488 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:02,493 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,497 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,501 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:02,505 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:23:02,509 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:02,513 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:02,690 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 22:23:02,690 INFO L628 ElimStorePlain]: treesize reduction 313, result has 38.3 percent of original size [2021-06-05 22:23:02,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:23:02,692 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:23:03,116 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 22:23:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:03,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523671613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:03,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:03,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:23:03,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617981749] [2021-06-05 22:23:03,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:23:03,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:23:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:23:03,298 INFO L87 Difference]: Start difference. First operand 440 states and 1356 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:03,704 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2021-06-05 22:23:04,005 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2021-06-05 22:23:04,299 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 22:23:04,669 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2021-06-05 22:23:05,206 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2021-06-05 22:23:05,483 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2021-06-05 22:23:06,097 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2021-06-05 22:23:06,371 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2021-06-05 22:23:06,699 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2021-06-05 22:23:07,052 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 22:23:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:07,072 INFO L93 Difference]: Finished difference Result 727 states and 2064 transitions. [2021-06-05 22:23:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:23:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:07,073 INFO L225 Difference]: With dead ends: 727 [2021-06-05 22:23:07,073 INFO L226 Difference]: Without dead ends: 706 [2021-06-05 22:23:07,073 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4312.7ms TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:23:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-06-05 22:23:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 443. [2021-06-05 22:23:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0927601809954752) internal successors, (1367), 442 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1367 transitions. [2021-06-05 22:23:07,078 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1367 transitions. Word has length 20 [2021-06-05 22:23:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:07,078 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1367 transitions. [2021-06-05 22:23:07,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1367 transitions. [2021-06-05 22:23:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:07,079 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:07,079 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:07,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6813,261 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:07,279 INFO L430 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1084178636, now seen corresponding path program 60 times [2021-06-05 22:23:07,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:07,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413639793] [2021-06-05 22:23:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:07,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:07,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413639793] [2021-06-05 22:23:07,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413639793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:07,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582045437] [2021-06-05 22:23:07,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:07,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:23:07,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:23:07,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:08,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:08,128 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:08,135 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:08,141 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,538 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 114 [2021-06-05 22:23:08,539 INFO L628 ElimStorePlain]: treesize reduction 179, result has 69.8 percent of original size [2021-06-05 22:23:08,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:08,546 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,730 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 22:23:08,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:08,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:08,737 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:08,743 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,917 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:23:08,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:08,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:08,925 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:08,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:08,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:08,931 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:09,089 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:23:09,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:09,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:09,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:09,096 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:09,253 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 22:23:09,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:09,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:09,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:09,259 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:09,414 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:23:09,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:09,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:09,422 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:621, output treesize:316 [2021-06-05 22:23:09,679 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-06-05 22:23:09,916 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1220, v_prenex_1230, v_prenex_1241, v_prenex_1222, v_prenex_1232, v_prenex_1224, v_prenex_1234, v_prenex_1226, v_prenex_1236, v_prenex_1214, v_prenex_1228, v_prenex_1216, v_prenex_1218], 1=[v_prenex_1231, v_prenex_1242, v_prenex_1233, v_prenex_1221, v_prenex_1235, v_prenex_1223, v_prenex_1237, v_prenex_1215, get_0, v_prenex_1225, v_prenex_1217, v_prenex_1227, v_prenex_1219, v_prenex_1229]} [2021-06-05 22:23:09,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 22:23:09,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:10,496 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 122 [2021-06-05 22:23:10,496 INFO L628 ElimStorePlain]: treesize reduction 1141, result has 24.9 percent of original size [2021-06-05 22:23:10,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:10,503 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:10,668 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 22:23:10,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:10,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:10,675 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:10,839 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:23:10,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:10,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:10,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:11,007 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 22:23:11,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:11,008 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1222 vanished before elimination [2021-06-05 22:23:11,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:11,014 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:11,174 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:23:11,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:11,174 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1224 vanished before elimination [2021-06-05 22:23:11,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:23:11,180 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:11,337 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 22:23:11,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:11,337 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1226 vanished before elimination [2021-06-05 22:23:11,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:11,343 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:11,502 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:23:11,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:11,502 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1214 vanished before elimination [2021-06-05 22:23:11,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:23:11,507 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:11,654 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:23:11,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1216 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1218 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1231 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1242 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1233 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1221 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1235 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1223 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1237 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1215 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1225 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1217 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1227 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1219 vanished before elimination [2021-06-05 22:23:11,655 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1229 vanished before elimination [2021-06-05 22:23:11,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:23:11,660 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1527, output treesize:289 [2021-06-05 22:23:11,926 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 22:23:12,469 WARN L205 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2021-06-05 22:23:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:12,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582045437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:12,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:12,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:12,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041465177] [2021-06-05 22:23:12,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:12,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:12,721 INFO L87 Difference]: Start difference. First operand 443 states and 1367 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:13,280 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 138 [2021-06-05 22:23:13,724 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2021-06-05 22:23:14,387 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-06-05 22:23:15,132 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 94 [2021-06-05 22:23:15,446 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2021-06-05 22:23:16,252 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 101 [2021-06-05 22:23:16,565 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2021-06-05 22:23:16,746 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-05 22:23:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:16,764 INFO L93 Difference]: Finished difference Result 695 states and 2002 transitions. [2021-06-05 22:23:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 22:23:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:16,765 INFO L225 Difference]: With dead ends: 695 [2021-06-05 22:23:16,766 INFO L226 Difference]: Without dead ends: 680 [2021-06-05 22:23:16,766 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5297.0ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:23:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-06-05 22:23:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 440. [2021-06-05 22:23:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0888382687927107) internal successors, (1356), 439 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1356 transitions. [2021-06-05 22:23:16,771 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1356 transitions. Word has length 20 [2021-06-05 22:23:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:16,771 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1356 transitions. [2021-06-05 22:23:16,771 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1356 transitions. [2021-06-05 22:23:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:16,771 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:16,771 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:16,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6846,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:16,972 INFO L430 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1067241584, now seen corresponding path program 61 times [2021-06-05 22:23:16,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:16,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950236808] [2021-06-05 22:23:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:17,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:17,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950236808] [2021-06-05 22:23:17,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950236808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:17,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609675171] [2021-06-05 22:23:17,402 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:17,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:23:17,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:17,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:17,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:17,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:17,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:17,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:17,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:17,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:17,798 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:17,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:17,804 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:17,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:17,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:17,809 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,109 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 22:23:18,110 INFO L628 ElimStorePlain]: treesize reduction 354, result has 48.0 percent of original size [2021-06-05 22:23:18,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:18,115 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:18,120 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:18,125 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,361 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 22:23:18,362 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:23:18,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:18,367 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:18,372 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:18,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:18,376 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:18,486 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-06-05 22:23:18,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:18,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:18,493 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:243 [2021-06-05 22:23:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:19,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609675171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:19,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:19,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:19,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294779735] [2021-06-05 22:23:19,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:19,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:19,184 INFO L87 Difference]: Start difference. First operand 440 states and 1356 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:19,719 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2021-06-05 22:23:20,101 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2021-06-05 22:23:20,537 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2021-06-05 22:23:21,005 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2021-06-05 22:23:21,175 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2021-06-05 22:23:21,647 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2021-06-05 22:23:21,913 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 22:23:22,533 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 98 [2021-06-05 22:23:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:22,600 INFO L93 Difference]: Finished difference Result 689 states and 1999 transitions. [2021-06-05 22:23:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:23:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:22,601 INFO L225 Difference]: With dead ends: 689 [2021-06-05 22:23:22,601 INFO L226 Difference]: Without dead ends: 674 [2021-06-05 22:23:22,602 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3801.8ms TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:23:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-06-05 22:23:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 442. [2021-06-05 22:23:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.0952380952380953) internal successors, (1365), 441 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1365 transitions. [2021-06-05 22:23:22,607 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1365 transitions. Word has length 20 [2021-06-05 22:23:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:22,607 INFO L482 AbstractCegarLoop]: Abstraction has 442 states and 1365 transitions. [2021-06-05 22:23:22,607 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1365 transitions. [2021-06-05 22:23:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:22,607 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:22,607 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:22,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 263 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6919 [2021-06-05 22:23:22,808 INFO L430 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2087441876, now seen corresponding path program 62 times [2021-06-05 22:23:22,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:22,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945118185] [2021-06-05 22:23:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:23,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:23,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945118185] [2021-06-05 22:23:23,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945118185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:23,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855216065] [2021-06-05 22:23:23,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:23,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:23:23,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:23:23,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:23,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:23,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:23,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,102 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2021-06-05 22:23:24,102 INFO L628 ElimStorePlain]: treesize reduction 179, result has 67.7 percent of original size [2021-06-05 22:23:24,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:24,108 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,274 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:23:24,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:24,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:24,281 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:24,287 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,443 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:23:24,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:24,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:24,450 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,602 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:23:24,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:24,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:24,609 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:24,615 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,762 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 22:23:24,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:24,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:24,769 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:24,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:24,775 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:24,908 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 22:23:24,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:24,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:24,915 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:561, output treesize:265 [2021-06-05 22:23:25,157 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2021-06-05 22:23:25,867 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1271, v_prenex_1281, v_prenex_1273, v_prenex_1275, get_6, v_prenex_1277, v_prenex_1279], 1=[v_prenex_1280, v_prenex_1282, v_prenex_1272, v_prenex_1274, v_prenex_1276, v_prenex_1278, get_0]} [2021-06-05 22:23:25,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:25,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:25,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:25,887 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:25,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:25,897 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:25,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:25,907 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:25,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:25,916 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:25,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:25,926 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:26,513 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 102 [2021-06-05 22:23:26,514 INFO L628 ElimStorePlain]: treesize reduction 1747, result has 17.0 percent of original size [2021-06-05 22:23:26,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:26,520 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:26,681 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:23:26,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:26,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:23:26,688 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:26,842 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:23:26,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:26,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:26,848 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:27,006 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:23:27,007 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:27,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:27,012 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:27,162 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 22:23:27,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:27,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:27,168 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:27,315 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:23:27,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:27,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:23:27,320 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:27,463 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 22:23:27,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1280 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1282 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1272 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1274 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1276 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1278 vanished before elimination [2021-06-05 22:23:27,464 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:23:27,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:23:27,467 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2269, output treesize:254 [2021-06-05 22:23:27,608 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-05 22:23:28,147 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-06-05 22:23:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:28,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855216065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:28,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:28,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:28,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401577523] [2021-06-05 22:23:28,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:28,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:28,368 INFO L87 Difference]: Start difference. First operand 442 states and 1365 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:28,867 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2021-06-05 22:23:29,265 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 133 [2021-06-05 22:23:29,781 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2021-06-05 22:23:30,440 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 89 [2021-06-05 22:23:30,596 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-06-05 22:23:31,327 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 96 [2021-06-05 22:23:31,511 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2021-06-05 22:23:32,339 WARN L205 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2021-06-05 22:23:32,655 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2021-06-05 22:23:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:32,722 INFO L93 Difference]: Finished difference Result 679 states and 1991 transitions. [2021-06-05 22:23:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 22:23:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:32,723 INFO L225 Difference]: With dead ends: 679 [2021-06-05 22:23:32,723 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 22:23:32,723 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5494.8ms TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:23:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 22:23:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 440. [2021-06-05 22:23:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0888382687927107) internal successors, (1356), 439 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1356 transitions. [2021-06-05 22:23:32,728 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1356 transitions. Word has length 20 [2021-06-05 22:23:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:32,728 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1356 transitions. [2021-06-05 22:23:32,728 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1356 transitions. [2021-06-05 22:23:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:32,729 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:32,729 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:32,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7024 [2021-06-05 22:23:32,930 INFO L430 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash -322665892, now seen corresponding path program 63 times [2021-06-05 22:23:32,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:32,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836377198] [2021-06-05 22:23:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:33,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:33,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836377198] [2021-06-05 22:23:33,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836377198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:33,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467969342] [2021-06-05 22:23:33,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:33,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:23:33,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:33,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:23:33,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:33,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:33,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:33,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:33,741 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:33,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:33,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:33,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:33,755 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:33,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:33,761 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:33,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:33,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:33,767 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,060 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 22:23:34,060 INFO L628 ElimStorePlain]: treesize reduction 357, result has 48.0 percent of original size [2021-06-05 22:23:34,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:34,066 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:34,072 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:34,077 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,305 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 22:23:34,306 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:23:34,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:34,311 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:34,317 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:34,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:34,321 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:34,434 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-06-05 22:23:34,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:34,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:34,441 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:246 [2021-06-05 22:23:34,766 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 22:23:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:35,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467969342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:35,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:35,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:35,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614031374] [2021-06-05 22:23:35,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:35,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:35,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:35,128 INFO L87 Difference]: Start difference. First operand 440 states and 1356 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:35,651 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 22:23:36,024 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-06-05 22:23:36,401 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2021-06-05 22:23:37,087 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 140 [2021-06-05 22:23:37,331 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2021-06-05 22:23:37,612 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 22:23:37,823 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2021-06-05 22:23:38,167 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2021-06-05 22:23:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:38,201 INFO L93 Difference]: Finished difference Result 642 states and 1870 transitions. [2021-06-05 22:23:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:23:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:38,202 INFO L225 Difference]: With dead ends: 642 [2021-06-05 22:23:38,202 INFO L226 Difference]: Without dead ends: 588 [2021-06-05 22:23:38,202 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3624.2ms TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2021-06-05 22:23:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-06-05 22:23:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 446. [2021-06-05 22:23:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0831460674157305) internal successors, (1372), 445 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1372 transitions. [2021-06-05 22:23:38,206 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1372 transitions. Word has length 20 [2021-06-05 22:23:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:38,206 INFO L482 AbstractCegarLoop]: Abstraction has 446 states and 1372 transitions. [2021-06-05 22:23:38,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1372 transitions. [2021-06-05 22:23:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:38,207 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:38,207 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:38,407 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7192,265 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:38,407 INFO L430 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:38,408 INFO L82 PathProgramCache]: Analyzing trace with hash -638777248, now seen corresponding path program 64 times [2021-06-05 22:23:38,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:38,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570570377] [2021-06-05 22:23:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:38,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:38,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570570377] [2021-06-05 22:23:38,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570570377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:38,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687708248] [2021-06-05 22:23:38,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:38,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:23:38,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:23:38,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:39,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:39,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:39,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:39,232 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:39,238 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:39,245 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:39,250 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,555 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 22:23:39,555 INFO L628 ElimStorePlain]: treesize reduction 348, result has 49.2 percent of original size [2021-06-05 22:23:39,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:39,561 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:39,566 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:39,572 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,697 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 22:23:39,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:39,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:39,703 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:39,709 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:39,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:39,713 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:39,922 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 22:23:39,923 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:23:39,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:39,929 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:238 [2021-06-05 22:23:40,458 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 22:23:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:40,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687708248] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:40,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:40,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:40,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830290645] [2021-06-05 22:23:40,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:40,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:40,630 INFO L87 Difference]: Start difference. First operand 446 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:41,339 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2021-06-05 22:23:41,708 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2021-06-05 22:23:42,014 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2021-06-05 22:23:42,439 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 22:23:42,974 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2021-06-05 22:23:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:42,990 INFO L93 Difference]: Finished difference Result 626 states and 1827 transitions. [2021-06-05 22:23:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:23:42,991 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:42,991 INFO L225 Difference]: With dead ends: 626 [2021-06-05 22:23:42,991 INFO L226 Difference]: Without dead ends: 605 [2021-06-05 22:23:42,992 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2999.6ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:23:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-06-05 22:23:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 452. [2021-06-05 22:23:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.0776053215077606) internal successors, (1388), 451 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1388 transitions. [2021-06-05 22:23:42,996 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1388 transitions. Word has length 20 [2021-06-05 22:23:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:42,996 INFO L482 AbstractCegarLoop]: Abstraction has 452 states and 1388 transitions. [2021-06-05 22:23:42,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1388 transitions. [2021-06-05 22:23:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:42,997 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:42,997 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:43,197 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7279 [2021-06-05 22:23:43,197 INFO L430 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1957469660, now seen corresponding path program 65 times [2021-06-05 22:23:43,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:43,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102247526] [2021-06-05 22:23:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:43,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:43,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102247526] [2021-06-05 22:23:43,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102247526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:43,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861078623] [2021-06-05 22:23:43,626 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:43,655 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:23:43,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:43,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:23:43,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:43,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:43,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:43,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:43,927 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:43,931 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:43,936 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:43,940 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:23:43,945 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:43,949 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:43,953 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:43,958 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:43,962 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:43,967 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:43,971 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:43,976 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:43,980 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:43,984 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:43,989 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:23:43,993 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:43,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:23:43,998 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:44,002 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:44,006 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:44,011 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:44,015 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:44,019 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:44,225 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 22:23:44,225 INFO L628 ElimStorePlain]: treesize reduction 168, result has 61.2 percent of original size [2021-06-05 22:23:44,227 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:23:44,227 INFO L247 ElimStorePlain]: Needed 25 recursive calls to eliminate 1 variables, input treesize:1009, output treesize:265 [2021-06-05 22:23:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:44,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861078623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:44,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:44,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:23:44,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559270445] [2021-06-05 22:23:44,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:23:44,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:23:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:23:44,845 INFO L87 Difference]: Start difference. First operand 452 states and 1388 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:45,262 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 22:23:45,504 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2021-06-05 22:23:45,883 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2021-06-05 22:23:46,087 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2021-06-05 22:23:46,434 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 22:23:46,732 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-06-05 22:23:47,193 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2021-06-05 22:23:47,756 WARN L205 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2021-06-05 22:23:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:47,778 INFO L93 Difference]: Finished difference Result 634 states and 1855 transitions. [2021-06-05 22:23:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:23:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:47,779 INFO L225 Difference]: With dead ends: 634 [2021-06-05 22:23:47,779 INFO L226 Difference]: Without dead ends: 572 [2021-06-05 22:23:47,779 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3534.2ms TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:23:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-05 22:23:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 443. [2021-06-05 22:23:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.079185520361991) internal successors, (1361), 442 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1361 transitions. [2021-06-05 22:23:47,784 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1361 transitions. Word has length 20 [2021-06-05 22:23:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:47,784 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1361 transitions. [2021-06-05 22:23:47,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1361 transitions. [2021-06-05 22:23:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:47,784 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:47,784 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:47,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7358,267 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:47,985 INFO L430 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash 266313232, now seen corresponding path program 66 times [2021-06-05 22:23:47,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:47,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047295746] [2021-06-05 22:23:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:48,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:48,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047295746] [2021-06-05 22:23:48,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047295746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:48,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984210512] [2021-06-05 22:23:48,346 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:48,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:23:48,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:23:48,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:23:48,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:48,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:48,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:48,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:48,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:48,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:48,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:48,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:48,792 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:48,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:48,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:23:48,798 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,050 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2021-06-05 22:23:49,050 INFO L628 ElimStorePlain]: treesize reduction 112, result has 73.6 percent of original size [2021-06-05 22:23:49,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:49,057 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:49,063 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,179 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:23:49,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:49,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:49,186 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,300 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:23:49,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:49,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:49,307 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:49,320 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,422 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:23:49,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:49,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:49,428 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:49,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:49,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:49,532 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:49,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:49,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:49,635 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:505, output treesize:223 [2021-06-05 22:23:49,821 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:23:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:50,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984210512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:50,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:50,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:50,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109279260] [2021-06-05 22:23:50,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:50,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:50,274 INFO L87 Difference]: Start difference. First operand 443 states and 1361 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:50,755 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 22:23:51,113 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 22:23:51,443 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2021-06-05 22:23:51,683 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-06-05 22:23:51,984 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2021-06-05 22:23:52,358 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2021-06-05 22:23:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:23:52,372 INFO L93 Difference]: Finished difference Result 630 states and 1831 transitions. [2021-06-05 22:23:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:23:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:23:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:23:52,374 INFO L225 Difference]: With dead ends: 630 [2021-06-05 22:23:52,374 INFO L226 Difference]: Without dead ends: 609 [2021-06-05 22:23:52,374 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2688.9ms TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:23:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2021-06-05 22:23:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 449. [2021-06-05 22:23:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0736607142857144) internal successors, (1377), 448 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1377 transitions. [2021-06-05 22:23:52,378 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1377 transitions. Word has length 20 [2021-06-05 22:23:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:23:52,379 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1377 transitions. [2021-06-05 22:23:52,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1377 transitions. [2021-06-05 22:23:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:23:52,379 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:23:52,379 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:23:52,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 268 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7406 [2021-06-05 22:23:52,580 INFO L430 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:23:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:23:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1432407156, now seen corresponding path program 67 times [2021-06-05 22:23:52,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:23:52,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628993712] [2021-06-05 22:23:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:23:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:52,882 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-06-05 22:23:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:52,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:23:52,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628993712] [2021-06-05 22:23:52,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628993712] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:52,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195292459] [2021-06-05 22:23:52,980 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:23:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:23:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:23:53,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:23:53,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:53,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:53,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:53,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:53,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:53,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:53,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:53,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:53,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:53,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:53,678 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,026 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2021-06-05 22:23:54,026 INFO L628 ElimStorePlain]: treesize reduction 120, result has 75.5 percent of original size [2021-06-05 22:23:54,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:54,034 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:54,042 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,200 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:23:54,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:54,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:54,207 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,368 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:23:54,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:54,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:54,375 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,528 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:23:54,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:54,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:54,536 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:23:54,542 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,691 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:23:54,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:54,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:23:54,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:23:54,698 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:54,846 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:23:54,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:54,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:23:54,854 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:601, output treesize:295 [2021-06-05 22:23:55,127 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 22:23:55,926 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1350, v_prenex_1360, v_prenex_1374, v_prenex_1352, get_6, v_prenex_1362, v_prenex_1354, v_prenex_1364, v_prenex_1356, v_prenex_1366, v_prenex_1358, v_prenex_1346, v_prenex_1368, v_prenex_1348], 1=[get_3, v_prenex_1361, v_prenex_1363, v_prenex_1373, v_prenex_1351, v_prenex_1365, v_prenex_1353, v_prenex_1345, v_prenex_1367, v_prenex_1355, v_prenex_1347, v_prenex_1357, v_prenex_1349, v_prenex_1359]} [2021-06-05 22:23:55,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:55,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:55,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:23:55,955 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:55,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:23:55,969 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:56,537 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 104 [2021-06-05 22:23:56,537 INFO L628 ElimStorePlain]: treesize reduction 1085, result has 26.3 percent of original size [2021-06-05 22:23:56,537 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1360 vanished before elimination [2021-06-05 22:23:56,537 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1374 vanished before elimination [2021-06-05 22:23:56,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:56,545 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:56,715 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:23:56,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:56,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:56,722 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:56,888 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 22:23:56,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:56,889 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1362 vanished before elimination [2021-06-05 22:23:56,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:56,895 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:57,059 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:23:57,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:57,059 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1364 vanished before elimination [2021-06-05 22:23:57,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:23:57,065 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:57,221 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:23:57,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:57,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:23:57,227 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:57,384 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 22:23:57,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:57,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1358 vanished before elimination [2021-06-05 22:23:57,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1346 vanished before elimination [2021-06-05 22:23:57,385 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1368 vanished before elimination [2021-06-05 22:23:57,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:23:57,390 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:23:57,546 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 22:23:57,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:23:57,546 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:23:57,546 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1361 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1363 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1373 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1351 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1365 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1353 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1345 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1367 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1355 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1347 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1357 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1349 vanished before elimination [2021-06-05 22:23:57,547 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1359 vanished before elimination [2021-06-05 22:23:57,551 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:23:57,551 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 42 variables, input treesize:1587, output treesize:292 [2021-06-05 22:23:57,710 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 22:23:57,929 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-06-05 22:23:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:23:58,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195292459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:23:58,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:23:58,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:23:58,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586164916] [2021-06-05 22:23:58,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:23:58,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:23:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:23:58,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:23:58,073 INFO L87 Difference]: Start difference. First operand 449 states and 1377 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:23:58,610 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-06-05 22:23:58,955 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-06-05 22:23:59,371 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 125 [2021-06-05 22:23:59,754 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2021-06-05 22:24:00,204 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2021-06-05 22:24:00,699 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2021-06-05 22:24:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:00,733 INFO L93 Difference]: Finished difference Result 631 states and 1837 transitions. [2021-06-05 22:24:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:00,734 INFO L225 Difference]: With dead ends: 631 [2021-06-05 22:24:00,734 INFO L226 Difference]: Without dead ends: 616 [2021-06-05 22:24:00,734 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3544.3ms TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:24:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-06-05 22:24:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 446. [2021-06-05 22:24:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0764044943820226) internal successors, (1369), 445 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1369 transitions. [2021-06-05 22:24:00,739 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1369 transitions. Word has length 20 [2021-06-05 22:24:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:00,739 INFO L482 AbstractCegarLoop]: Abstraction has 446 states and 1369 transitions. [2021-06-05 22:24:00,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1369 transitions. [2021-06-05 22:24:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:00,739 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:00,740 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:00,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7500 [2021-06-05 22:24:00,940 INFO L430 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1605654848, now seen corresponding path program 68 times [2021-06-05 22:24:00,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:00,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813240133] [2021-06-05 22:24:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:01,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:01,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813240133] [2021-06-05 22:24:01,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813240133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:01,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349593379] [2021-06-05 22:24:01,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:01,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:24:01,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:01,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:24:01,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:01,732 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2021-06-05 22:24:02,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:02,210 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:02,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:02,226 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:02,234 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:02,242 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:02,249 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,805 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2021-06-05 22:24:02,806 INFO L628 ElimStorePlain]: treesize reduction 606, result has 47.4 percent of original size [2021-06-05 22:24:02,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:02,813 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:02,820 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:02,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:02,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:02,827 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,289 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2021-06-05 22:24:03,289 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 22:24:03,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:03,296 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:03,303 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:03,310 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,530 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 22:24:03,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:03,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:03,537 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:03,544 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:03,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:03,550 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:03,764 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 22:24:03,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:03,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2021-06-05 22:24:03,774 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1321, output treesize:440 [2021-06-05 22:24:04,000 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2021-06-05 22:24:04,374 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2021-06-05 22:24:04,633 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1397, v_prenex_1411, v_prenex_1399, v_prenex_1421, v_prenex_1413, v_prenex_1401, v_prenex_1423, v_prenex_1415, v_prenex_1403, v_prenex_1428, v_prenex_1417, v_prenex_1405, v_prenex_1419, v_prenex_1407, v_prenex_1409], 1=[get_3, v_prenex_1396, v_prenex_1398, v_prenex_1420, v_prenex_1400, v_prenex_1422, v_prenex_1410, v_prenex_1402, v_prenex_1412, v_prenex_1404, v_prenex_1414, v_prenex_1406, v_prenex_1427, v_prenex_1416, v_prenex_1408, v_prenex_1418]} [2021-06-05 22:24:04,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:04,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:04,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:04,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:04,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:04,680 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:05,270 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 123 [2021-06-05 22:24:05,270 INFO L628 ElimStorePlain]: treesize reduction 1244, result has 24.1 percent of original size [2021-06-05 22:24:05,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:05,279 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:05,446 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 22:24:05,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:05,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:05,454 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:05,620 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:24:05,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:05,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:05,629 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:05,786 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 22:24:05,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:05,787 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1421 vanished before elimination [2021-06-05 22:24:05,787 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1413 vanished before elimination [2021-06-05 22:24:05,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:05,794 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:05,948 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:24:05,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:05,948 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1423 vanished before elimination [2021-06-05 22:24:05,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:05,955 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:06,113 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 22:24:06,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:06,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:06,119 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:06,264 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:24:06,264 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:06,265 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1428 vanished before elimination [2021-06-05 22:24:06,265 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1417 vanished before elimination [2021-06-05 22:24:06,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:06,270 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:06,411 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:24:06,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1419 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1407 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1409 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1396 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1398 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1420 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1400 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1422 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1410 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1402 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1412 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1404 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1414 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1406 vanished before elimination [2021-06-05 22:24:06,412 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1427 vanished before elimination [2021-06-05 22:24:06,413 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1416 vanished before elimination [2021-06-05 22:24:06,413 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1408 vanished before elimination [2021-06-05 22:24:06,413 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1418 vanished before elimination [2021-06-05 22:24:06,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 32 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 22:24:06,416 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 48 variables, input treesize:1751, output treesize:272 [2021-06-05 22:24:06,642 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 22:24:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:06,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349593379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:06,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:06,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:06,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206952596] [2021-06-05 22:24:06,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:06,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:06,778 INFO L87 Difference]: Start difference. First operand 446 states and 1369 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:07,210 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2021-06-05 22:24:07,684 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 161 [2021-06-05 22:24:08,349 WARN L205 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 178 [2021-06-05 22:24:08,596 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-05 22:24:08,894 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 22:24:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:08,919 INFO L93 Difference]: Finished difference Result 604 states and 1781 transitions. [2021-06-05 22:24:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:08,920 INFO L225 Difference]: With dead ends: 604 [2021-06-05 22:24:08,920 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 22:24:08,920 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3204.3ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-06-05 22:24:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 22:24:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 443. [2021-06-05 22:24:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.079185520361991) internal successors, (1361), 442 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1361 transitions. [2021-06-05 22:24:08,925 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1361 transitions. Word has length 20 [2021-06-05 22:24:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:08,925 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1361 transitions. [2021-06-05 22:24:08,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1361 transitions. [2021-06-05 22:24:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:08,926 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:08,926 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:09,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7755,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:09,126 INFO L430 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -917231582, now seen corresponding path program 69 times [2021-06-05 22:24:09,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:09,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869895224] [2021-06-05 22:24:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:09,582 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2021-06-05 22:24:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:09,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:09,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869895224] [2021-06-05 22:24:09,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869895224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:09,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751460889] [2021-06-05 22:24:09,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:09,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:24:09,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:09,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:24:09,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:09,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:09,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:09,894 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:09,899 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:09,903 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:09,908 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:09,913 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:09,918 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:09,922 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:09,927 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:09,931 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:24:09,936 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:09,941 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:09,945 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:09,950 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:24:09,955 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:09,959 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:09,964 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:09,968 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:24:09,973 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:09,977 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:09,982 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:09,986 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:09,991 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:09,995 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:09,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:24:10,000 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:10,004 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:10,009 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:10,013 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:10,018 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:10,022 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:10,037 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:10,043 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:10,049 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:10,054 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:10,059 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:10,062 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:10,246 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 22:24:10,247 INFO L628 ElimStorePlain]: treesize reduction 313, result has 38.3 percent of original size [2021-06-05 22:24:10,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:24:10,249 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:24:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:10,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751460889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:10,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:10,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:10,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614721973] [2021-06-05 22:24:10,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:10,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:10,744 INFO L87 Difference]: Start difference. First operand 443 states and 1361 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:11,422 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-06-05 22:24:11,669 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2021-06-05 22:24:12,013 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2021-06-05 22:24:12,463 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 83 [2021-06-05 22:24:12,928 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2021-06-05 22:24:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:12,941 INFO L93 Difference]: Finished difference Result 685 states and 1970 transitions. [2021-06-05 22:24:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:12,942 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:12,942 INFO L225 Difference]: With dead ends: 685 [2021-06-05 22:24:12,942 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 22:24:12,942 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2851.8ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:24:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 22:24:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 447. [2021-06-05 22:24:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.091928251121076) internal successors, (1379), 446 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1379 transitions. [2021-06-05 22:24:12,947 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1379 transitions. Word has length 20 [2021-06-05 22:24:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:12,947 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1379 transitions. [2021-06-05 22:24:12,947 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1379 transitions. [2021-06-05 22:24:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:12,948 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:12,948 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:13,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7926,271 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:13,148 INFO L430 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:13,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:13,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2135866942, now seen corresponding path program 70 times [2021-06-05 22:24:13,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:13,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625084494] [2021-06-05 22:24:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:13,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:13,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625084494] [2021-06-05 22:24:13,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625084494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:13,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123063016] [2021-06-05 22:24:13,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:13,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:24:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:13,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:24:13,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:13,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:13,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:13,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:13,964 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:13,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:13,971 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:13,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:13,978 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:13,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:13,985 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:13,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:13,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:13,991 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,288 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 22:24:14,288 INFO L628 ElimStorePlain]: treesize reduction 334, result has 48.2 percent of original size [2021-06-05 22:24:14,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:14,294 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:14,299 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:14,303 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,531 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 22:24:14,532 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:24:14,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:14,537 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:14,542 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:14,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:14,546 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:14,656 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-06-05 22:24:14,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:14,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:14,663 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:243 [2021-06-05 22:24:15,161 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 22:24:15,343 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 22:24:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:15,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123063016] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:15,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:15,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:15,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141191528] [2021-06-05 22:24:15,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:15,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:15,522 INFO L87 Difference]: Start difference. First operand 447 states and 1379 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:16,411 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 128 [2021-06-05 22:24:16,788 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-06-05 22:24:17,265 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2021-06-05 22:24:17,812 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 85 [2021-06-05 22:24:18,421 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2021-06-05 22:24:18,943 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 92 [2021-06-05 22:24:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:18,951 INFO L93 Difference]: Finished difference Result 683 states and 1967 transitions. [2021-06-05 22:24:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:24:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:18,952 INFO L225 Difference]: With dead ends: 683 [2021-06-05 22:24:18,952 INFO L226 Difference]: Without dead ends: 668 [2021-06-05 22:24:18,953 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4121.0ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:24:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-06-05 22:24:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 445. [2021-06-05 22:24:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.09009009009009) internal successors, (1372), 444 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1372 transitions. [2021-06-05 22:24:18,957 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1372 transitions. Word has length 20 [2021-06-05 22:24:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:18,957 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1372 transitions. [2021-06-05 22:24:18,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1372 transitions. [2021-06-05 22:24:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:18,958 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:18,958 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:19,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7962,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:19,158 INFO L430 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 71828966, now seen corresponding path program 71 times [2021-06-05 22:24:19,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:19,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322083131] [2021-06-05 22:24:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:19,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:19,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322083131] [2021-06-05 22:24:19,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322083131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:19,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095986913] [2021-06-05 22:24:19,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:19,605 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:24:19,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:19,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:24:19,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:19,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,773 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:19,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:19,783 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:19,788 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,793 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:19,798 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:19,802 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,814 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,819 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:19,823 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,828 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:24:19,833 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:24:19,838 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,842 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,847 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,852 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,856 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:24:19,861 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,865 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,870 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:19,875 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,879 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,884 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:24:19,888 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:19,893 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:19,897 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:19,901 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:19,906 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:24:19,910 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:19,914 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:19,919 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,923 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:19,927 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:19,933 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:19,940 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:19,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:19,945 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:20,120 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 22:24:20,120 INFO L628 ElimStorePlain]: treesize reduction 323, result has 37.5 percent of original size [2021-06-05 22:24:20,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:24:20,122 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:24:20,480 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 22:24:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:20,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095986913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:20,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:20,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:24:20,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408568743] [2021-06-05 22:24:20,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:24:20,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:24:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:24:20,652 INFO L87 Difference]: Start difference. First operand 445 states and 1372 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:21,079 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-06-05 22:24:21,402 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2021-06-05 22:24:21,625 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-05 22:24:22,121 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2021-06-05 22:24:22,611 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2021-06-05 22:24:23,211 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 85 [2021-06-05 22:24:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:23,226 INFO L93 Difference]: Finished difference Result 716 states and 2038 transitions. [2021-06-05 22:24:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:23,227 INFO L225 Difference]: With dead ends: 716 [2021-06-05 22:24:23,227 INFO L226 Difference]: Without dead ends: 695 [2021-06-05 22:24:23,228 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 3079.0ms TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:24:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-06-05 22:24:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 448. [2021-06-05 22:24:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.0939597315436242) internal successors, (1383), 447 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1383 transitions. [2021-06-05 22:24:23,233 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1383 transitions. Word has length 20 [2021-06-05 22:24:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:23,233 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1383 transitions. [2021-06-05 22:24:23,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1383 transitions. [2021-06-05 22:24:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:23,233 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:23,233 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:23,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8042 [2021-06-05 22:24:23,434 INFO L430 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1098360030, now seen corresponding path program 72 times [2021-06-05 22:24:23,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:23,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352298703] [2021-06-05 22:24:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:23,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:23,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352298703] [2021-06-05 22:24:23,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352298703] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:23,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208233332] [2021-06-05 22:24:23,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:23,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 22:24:23,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:23,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:24:23,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:24,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:24,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:24,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:24,776 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-06-05 22:24:24,776 INFO L628 ElimStorePlain]: treesize reduction 203, result has 68.8 percent of original size [2021-06-05 22:24:24,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:24,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:24,783 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:24,991 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:24:24,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:24,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:24,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:24,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:24,999 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:25,005 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,196 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:24:25,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:25,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:25,203 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:25,209 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,399 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:24:25,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:25,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:25,406 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:25,412 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,584 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:24:25,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:25,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:25,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:25,590 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:25,758 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:24:25,759 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:25,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:25,767 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:657, output treesize:343 [2021-06-05 22:24:26,052 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2021-06-05 22:24:26,279 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1491, v_prenex_1493, v_prenex_1471, v_prenex_1481, v_prenex_1473, get_6, v_prenex_1483, v_prenex_1475, v_prenex_1485, v_prenex_1477, v_prenex_1487, v_prenex_1479, v_prenex_1489, v_prenex_1500], 1=[get_3, v_prenex_1480, v_prenex_1490, v_prenex_1482, v_prenex_1492, v_prenex_1470, v_prenex_1484, v_prenex_1472, v_prenex_1486, v_prenex_1474, v_prenex_1499, v_prenex_1488, v_prenex_1476, v_prenex_1478]} [2021-06-05 22:24:26,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:26,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:26,898 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 121 [2021-06-05 22:24:26,899 INFO L628 ElimStorePlain]: treesize reduction 1212, result has 25.3 percent of original size [2021-06-05 22:24:26,899 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1493 vanished before elimination [2021-06-05 22:24:26,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:26,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:27,091 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 22:24:27,092 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:27,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:27,105 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:27,289 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-06-05 22:24:27,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:27,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:27,297 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:27,477 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:24:27,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:27,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:27,484 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:27,661 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 22:24:27,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:27,662 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1483 vanished before elimination [2021-06-05 22:24:27,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:27,668 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:27,843 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 22:24:27,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:27,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:27,849 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:28,021 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 22:24:28,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:28,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:28,028 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:28,198 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:24:28,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1487 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1479 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1489 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1500 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1480 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1490 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1482 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1492 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1470 vanished before elimination [2021-06-05 22:24:28,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1484 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1472 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1486 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1474 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1499 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1488 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1476 vanished before elimination [2021-06-05 22:24:28,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1478 vanished before elimination [2021-06-05 22:24:28,204 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:24:28,204 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1629, output treesize:328 [2021-06-05 22:24:28,515 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-06-05 22:24:29,120 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-06-05 22:24:29,385 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 22:24:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:29,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208233332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:29,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:29,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:29,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624997248] [2021-06-05 22:24:29,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:29,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:29,521 INFO L87 Difference]: Start difference. First operand 448 states and 1383 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:30,046 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 22:24:30,403 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-05 22:24:30,929 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2021-06-05 22:24:31,641 WARN L205 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 22:24:32,438 WARN L205 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2021-06-05 22:24:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:32,465 INFO L93 Difference]: Finished difference Result 700 states and 2018 transitions. [2021-06-05 22:24:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:32,466 INFO L225 Difference]: With dead ends: 700 [2021-06-05 22:24:32,466 INFO L226 Difference]: Without dead ends: 685 [2021-06-05 22:24:32,466 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4472.4ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 22:24:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-05 22:24:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 445. [2021-06-05 22:24:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.09009009009009) internal successors, (1372), 444 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1372 transitions. [2021-06-05 22:24:32,471 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1372 transitions. Word has length 20 [2021-06-05 22:24:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:32,472 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1372 transitions. [2021-06-05 22:24:32,472 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1372 transitions. [2021-06-05 22:24:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:32,472 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:32,472 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:32,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8076,274 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:32,673 INFO L430 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:32,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1115297082, now seen corresponding path program 73 times [2021-06-05 22:24:32,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:32,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917085411] [2021-06-05 22:24:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:32,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:32,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917085411] [2021-06-05 22:24:32,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917085411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:32,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406681695] [2021-06-05 22:24:32,971 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:24:33,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:33,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:33,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:33,358 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:33,365 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:33,372 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:33,379 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:33,385 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,699 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 22:24:33,699 INFO L628 ElimStorePlain]: treesize reduction 356, result has 47.9 percent of original size [2021-06-05 22:24:33,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:33,705 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:33,710 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:33,714 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,843 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-06-05 22:24:33,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:33,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:33,849 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:33,854 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:33,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:33,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:33,859 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:34,087 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 22:24:34,087 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:24:34,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:34,094 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:228 [2021-06-05 22:24:34,587 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 22:24:34,858 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 22:24:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:35,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406681695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:35,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:35,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:35,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543509795] [2021-06-05 22:24:35,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:35,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:35,052 INFO L87 Difference]: Start difference. First operand 445 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:35,926 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2021-06-05 22:24:36,286 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 22:24:36,804 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2021-06-05 22:24:37,302 WARN L205 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2021-06-05 22:24:37,939 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 89 [2021-06-05 22:24:38,427 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-06-05 22:24:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:38,435 INFO L93 Difference]: Finished difference Result 723 states and 2058 transitions. [2021-06-05 22:24:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:24:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:38,436 INFO L225 Difference]: With dead ends: 723 [2021-06-05 22:24:38,436 INFO L226 Difference]: Without dead ends: 708 [2021-06-05 22:24:38,437 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4084.7ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:24:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-06-05 22:24:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 447. [2021-06-05 22:24:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.096412556053812) internal successors, (1381), 446 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1381 transitions. [2021-06-05 22:24:38,442 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1381 transitions. Word has length 20 [2021-06-05 22:24:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:38,442 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1381 transitions. [2021-06-05 22:24:38,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1381 transitions. [2021-06-05 22:24:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:38,442 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:38,442 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:38,643 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8186,275 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:38,643 INFO L430 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:38,643 INFO L82 PathProgramCache]: Analyzing trace with hash 24986754, now seen corresponding path program 74 times [2021-06-05 22:24:38,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:38,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429055392] [2021-06-05 22:24:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:39,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:39,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429055392] [2021-06-05 22:24:39,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429055392] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:39,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340556987] [2021-06-05 22:24:39,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:39,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:24:39,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:39,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:24:39,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:39,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:39,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:39,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:39,612 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:39,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:39,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:39,988 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2021-06-05 22:24:39,989 INFO L628 ElimStorePlain]: treesize reduction 128, result has 74.9 percent of original size [2021-06-05 22:24:39,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:39,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:39,995 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,168 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 22:24:40,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:40,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:40,176 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:40,182 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,340 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 22:24:40,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:40,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:40,347 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:40,352 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,505 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 22:24:40,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:40,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:40,511 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,662 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:24:40,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:40,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:40,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:40,668 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:40,816 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:24:40,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:40,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:40,830 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:597, output treesize:292 [2021-06-05 22:24:41,102 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2021-06-05 22:24:41,323 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1550, get_6, v_prenex_1560, v_prenex_1552, v_prenex_1562, v_prenex_1540, v_prenex_1554, v_prenex_1542, v_prenex_1556, v_prenex_1544, v_prenex_1566, v_prenex_1558, v_prenex_1546, v_prenex_1548], 1=[get_3, v_prenex_1561, v_prenex_1541, v_prenex_1551, v_prenex_1543, v_prenex_1565, v_prenex_1553, v_prenex_1545, v_prenex_1555, v_prenex_1547, v_prenex_1557, v_prenex_1549, v_prenex_1559, v_prenex_1539]} [2021-06-05 22:24:41,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:41,337 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:41,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:41,351 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:41,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:41,364 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:41,902 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 102 [2021-06-05 22:24:41,902 INFO L628 ElimStorePlain]: treesize reduction 1003, result has 26.3 percent of original size [2021-06-05 22:24:41,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:41,909 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,070 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:24:42,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:42,076 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,234 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 22:24:42,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,235 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1552 vanished before elimination [2021-06-05 22:24:42,235 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1562 vanished before elimination [2021-06-05 22:24:42,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:42,241 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,396 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:24:42,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,396 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1554 vanished before elimination [2021-06-05 22:24:42,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:42,402 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,555 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 22:24:42,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,556 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1556 vanished before elimination [2021-06-05 22:24:42,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:42,562 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,711 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 22:24:42,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,711 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1566 vanished before elimination [2021-06-05 22:24:42,712 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1558 vanished before elimination [2021-06-05 22:24:42,712 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1546 vanished before elimination [2021-06-05 22:24:42,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:42,722 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:42,863 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 22:24:42,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1561 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1541 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1551 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1543 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1565 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1553 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1545 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1555 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1547 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1557 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1549 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1559 vanished before elimination [2021-06-05 22:24:42,864 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1539 vanished before elimination [2021-06-05 22:24:42,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 28 dim-1 vars, End of recursive call: and 13 xjuncts. [2021-06-05 22:24:42,868 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 42 variables, input treesize:1471, output treesize:254 [2021-06-05 22:24:43,010 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-05 22:24:43,406 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2021-06-05 22:24:43,621 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 22:24:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:43,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340556987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:43,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:43,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:43,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591400794] [2021-06-05 22:24:43,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:43,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:43,722 INFO L87 Difference]: Start difference. First operand 447 states and 1381 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:44,642 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 124 [2021-06-05 22:24:45,054 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2021-06-05 22:24:45,747 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2021-06-05 22:24:46,496 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 92 [2021-06-05 22:24:47,287 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 99 [2021-06-05 22:24:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:47,314 INFO L93 Difference]: Finished difference Result 709 states and 2042 transitions. [2021-06-05 22:24:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:47,315 INFO L225 Difference]: With dead ends: 709 [2021-06-05 22:24:47,315 INFO L226 Difference]: Without dead ends: 694 [2021-06-05 22:24:47,316 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4605.4ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:24:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-06-05 22:24:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2021-06-05 22:24:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.09009009009009) internal successors, (1372), 444 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1372 transitions. [2021-06-05 22:24:47,321 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1372 transitions. Word has length 20 [2021-06-05 22:24:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:47,321 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1372 transitions. [2021-06-05 22:24:47,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1372 transitions. [2021-06-05 22:24:47,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:47,321 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:47,321 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:47,521 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 276 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8265 [2021-06-05 22:24:47,522 INFO L430 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -82608552, now seen corresponding path program 75 times [2021-06-05 22:24:47,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:47,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305831578] [2021-06-05 22:24:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:47,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:47,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305831578] [2021-06-05 22:24:47,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305831578] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:47,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089769977] [2021-06-05 22:24:47,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:47,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:24:47,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:47,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:24:47,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:48,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:48,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:48,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:48,532 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:48,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:48,539 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:48,938 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-06-05 22:24:48,939 INFO L628 ElimStorePlain]: treesize reduction 130, result has 76.0 percent of original size [2021-06-05 22:24:48,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:48,946 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:48,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:48,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:48,952 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,140 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:24:49,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:49,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:49,147 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,335 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 22:24:49,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:49,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:49,342 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,532 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:24:49,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:49,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:49,539 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,718 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 22:24:49,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:49,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:49,725 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:49,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:49,731 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:49,900 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:24:49,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:49,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:49,911 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:657, output treesize:343 [2021-06-05 22:24:50,201 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2021-06-05 22:24:50,718 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2021-06-05 22:24:51,129 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1603, v_prenex_1605, v_prenex_1592, get_6, v_prenex_1594, v_prenex_1596, v_prenex_1587, v_prenex_1589, v_prenex_1599, v_prenex_1601], 1=[v_prenex_1604, get_3, v_prenex_1591, v_prenex_1593, v_prenex_1595, v_prenex_1598, v_prenex_1586, v_prenex_1600, v_prenex_1588, v_prenex_1602]} [2021-06-05 22:24:51,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:51,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:51,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:51,158 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:51,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:24:51,172 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:51,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:51,185 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:51,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:51,199 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:51,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:24:51,213 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:52,169 WARN L205 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 149 [2021-06-05 22:24:52,169 INFO L628 ElimStorePlain]: treesize reduction 2810, result has 15.0 percent of original size [2021-06-05 22:24:52,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:52,177 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:52,391 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2021-06-05 22:24:52,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:52,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:52,400 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:52,613 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 22:24:52,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:52,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:52,622 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:52,831 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2021-06-05 22:24:52,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:52,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:52,839 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:53,047 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-06-05 22:24:53,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:53,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:53,055 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:53,255 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 22:24:53,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:53,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:53,263 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:53,459 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 22:24:53,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:53,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:24:53,466 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:53,658 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 22:24:53,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:53,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:24:53,665 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:53,854 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:24:53,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:53,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-06-05 22:24:53,861 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:54,049 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:24:54,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1604 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1591 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1593 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1595 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1598 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1586 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1600 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1588 vanished before elimination [2021-06-05 22:24:54,050 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1602 vanished before elimination [2021-06-05 22:24:54,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 20 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 22:24:54,056 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 30 variables, input treesize:3421, output treesize:346 [2021-06-05 22:24:54,384 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 22:24:54,631 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 22:24:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:54,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089769977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:54,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:24:54,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:24:54,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993485827] [2021-06-05 22:24:54,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:24:54,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:24:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:24:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:24:54,780 INFO L87 Difference]: Start difference. First operand 445 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:55,328 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 22:24:56,076 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 170 [2021-06-05 22:24:56,452 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2021-06-05 22:24:57,091 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-06-05 22:24:57,824 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2021-06-05 22:24:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:24:57,836 INFO L93 Difference]: Finished difference Result 644 states and 1878 transitions. [2021-06-05 22:24:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:24:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:24:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:24:57,837 INFO L225 Difference]: With dead ends: 644 [2021-06-05 22:24:57,837 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 22:24:57,837 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4521.2ms TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-06-05 22:24:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 22:24:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 451. [2021-06-05 22:24:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.097777777777778) internal successors, (1394), 450 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1394 transitions. [2021-06-05 22:24:57,842 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1394 transitions. Word has length 20 [2021-06-05 22:24:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:24:57,842 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1394 transitions. [2021-06-05 22:24:57,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:24:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1394 transitions. [2021-06-05 22:24:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:24:57,843 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:24:57,843 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:24:58,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8391,277 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:58,043 INFO L430 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:24:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:24:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1252797548, now seen corresponding path program 76 times [2021-06-05 22:24:58,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:24:58,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328553256] [2021-06-05 22:24:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:24:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:24:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:24:58,670 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:24:58,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328553256] [2021-06-05 22:24:58,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328553256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:24:58,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325135398] [2021-06-05 22:24:58,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:24:58,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:24:58,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:24:58,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:24:58,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:24:59,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:59,039 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:59,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:24:59,051 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:24:59,057 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:24:59,064 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:24:59,069 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,369 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-06-05 22:24:59,370 INFO L628 ElimStorePlain]: treesize reduction 345, result has 46.8 percent of original size [2021-06-05 22:24:59,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:59,375 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:59,380 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:59,384 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,507 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-06-05 22:24:59,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:24:59,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:59,513 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:24:59,518 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:24:59,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:24:59,524 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:24:59,740 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 22:24:59,741 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:24:59,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:24:59,747 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:236 [2021-06-05 22:25:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:00,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325135398] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:00,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:00,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:00,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728418009] [2021-06-05 22:25:00,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:00,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:00,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:00,563 INFO L87 Difference]: Start difference. First operand 451 states and 1394 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:01,462 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 122 [2021-06-05 22:25:02,092 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 138 [2021-06-05 22:25:02,466 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-06-05 22:25:02,906 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2021-06-05 22:25:03,398 WARN L205 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 84 [2021-06-05 22:25:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:03,431 INFO L93 Difference]: Finished difference Result 645 states and 1884 transitions. [2021-06-05 22:25:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:25:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:03,432 INFO L225 Difference]: With dead ends: 645 [2021-06-05 22:25:03,432 INFO L226 Difference]: Without dead ends: 630 [2021-06-05 22:25:03,432 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3588.9ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:25:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-06-05 22:25:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 448. [2021-06-05 22:25:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.0939597315436242) internal successors, (1383), 447 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1383 transitions. [2021-06-05 22:25:03,437 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1383 transitions. Word has length 20 [2021-06-05 22:25:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:03,437 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1383 transitions. [2021-06-05 22:25:03,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1383 transitions. [2021-06-05 22:25:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:03,437 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:03,437 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:03,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8573 [2021-06-05 22:25:03,638 INFO L430 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash -998472254, now seen corresponding path program 77 times [2021-06-05 22:25:03,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:03,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807766655] [2021-06-05 22:25:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:04,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:04,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807766655] [2021-06-05 22:25:04,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807766655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:04,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520790971] [2021-06-05 22:25:04,028 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:04,056 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:25:04,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:04,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:04,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:04,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:04,234 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:04,245 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:04,250 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:04,256 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:04,261 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:25:04,266 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:04,272 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,277 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:04,282 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:25:04,288 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:04,293 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:04,298 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,303 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,308 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,314 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:04,319 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:04,324 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:04,329 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,334 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,340 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,345 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:04,351 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,357 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:04,362 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,368 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,373 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,378 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,384 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:04,389 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:04,394 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,399 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:04,403 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:04,408 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:04,412 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:04,438 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:04,615 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 22:25:04,615 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 22:25:04,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:25:04,617 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:25:04,966 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 22:25:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:05,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520790971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:05,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:05,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:25:05,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101432773] [2021-06-05 22:25:05,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:25:05,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:25:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:25:05,303 INFO L87 Difference]: Start difference. First operand 448 states and 1383 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:05,732 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2021-06-05 22:25:06,075 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2021-06-05 22:25:06,553 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2021-06-05 22:25:07,061 WARN L205 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2021-06-05 22:25:07,252 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-06-05 22:25:07,473 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-06-05 22:25:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:07,497 INFO L93 Difference]: Finished difference Result 625 states and 1840 transitions. [2021-06-05 22:25:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:25:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:07,498 INFO L225 Difference]: With dead ends: 625 [2021-06-05 22:25:07,498 INFO L226 Difference]: Without dead ends: 610 [2021-06-05 22:25:07,499 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2859.6ms TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:25:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-06-05 22:25:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 445. [2021-06-05 22:25:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.09009009009009) internal successors, (1372), 444 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1372 transitions. [2021-06-05 22:25:07,504 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1372 transitions. Word has length 20 [2021-06-05 22:25:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:07,504 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1372 transitions. [2021-06-05 22:25:07,504 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1372 transitions. [2021-06-05 22:25:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:07,504 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:07,504 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:07,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8678,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:07,705 INFO L430 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash 213400338, now seen corresponding path program 78 times [2021-06-05 22:25:07,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:07,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993468415] [2021-06-05 22:25:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:08,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:08,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993468415] [2021-06-05 22:25:08,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993468415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:08,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042395075] [2021-06-05 22:25:08,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:08,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:25:08,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:08,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:08,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:08,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:08,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:08,591 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:08,597 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:08,603 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:08,609 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:08,614 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,878 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 22:25:08,878 INFO L628 ElimStorePlain]: treesize reduction 326, result has 47.3 percent of original size [2021-06-05 22:25:08,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:25:08,884 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:08,889 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:08,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:08,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:08,894 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:09,103 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:25:09,104 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:25:09,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:09,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:09,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:09,109 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:09,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:09,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:09,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:09,113 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:09,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:09,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:09,118 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:09,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:09,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:25:09,218 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:805, output treesize:218 [2021-06-05 22:25:09,567 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-06-05 22:25:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:10,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042395075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:10,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:10,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:10,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14705342] [2021-06-05 22:25:10,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:10,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:10,034 INFO L87 Difference]: Start difference. First operand 445 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:10,916 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 128 [2021-06-05 22:25:11,488 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 137 [2021-06-05 22:25:11,750 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 22:25:12,078 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2021-06-05 22:25:12,654 WARN L205 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2021-06-05 22:25:12,969 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2021-06-05 22:25:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:12,976 INFO L93 Difference]: Finished difference Result 648 states and 1887 transitions. [2021-06-05 22:25:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 22:25:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:12,977 INFO L225 Difference]: With dead ends: 648 [2021-06-05 22:25:12,977 INFO L226 Difference]: Without dead ends: 633 [2021-06-05 22:25:12,977 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3634.4ms TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:25:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-06-05 22:25:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 449. [2021-06-05 22:25:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.0982142857142856) internal successors, (1388), 448 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1388 transitions. [2021-06-05 22:25:12,982 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1388 transitions. Word has length 20 [2021-06-05 22:25:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:12,982 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1388 transitions. [2021-06-05 22:25:12,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1388 transitions. [2021-06-05 22:25:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:12,982 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:12,982 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:13,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8713,280 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:13,183 INFO L430 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1353684174, now seen corresponding path program 79 times [2021-06-05 22:25:13,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:13,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145194725] [2021-06-05 22:25:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:13,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:13,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145194725] [2021-06-05 22:25:13,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145194725] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:13,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308581819] [2021-06-05 22:25:13,612 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:13,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:13,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:13,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:13,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,809 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:13,815 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:13,820 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:13,826 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:13,831 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:25:13,837 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:13,842 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,847 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:13,853 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:25:13,859 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:13,864 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:13,869 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,875 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,881 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,886 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:13,891 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:13,897 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:13,903 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,908 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,914 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,919 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:13,925 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,931 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:13,937 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,943 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,948 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,954 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,959 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:13,965 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:13,970 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,975 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:13,980 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:13,986 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:13,991 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:13,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:13,995 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:14,183 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 22:25:14,183 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 22:25:14,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:25:14,185 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 22:25:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:14,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308581819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:14,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:14,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:14,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658312076] [2021-06-05 22:25:14,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:14,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:14,674 INFO L87 Difference]: Start difference. First operand 449 states and 1388 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:15,398 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 22:25:15,983 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2021-06-05 22:25:16,210 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 22:25:16,891 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 22:25:17,675 WARN L205 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2021-06-05 22:25:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:17,700 INFO L93 Difference]: Finished difference Result 655 states and 1905 transitions. [2021-06-05 22:25:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:25:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:17,701 INFO L225 Difference]: With dead ends: 655 [2021-06-05 22:25:17,701 INFO L226 Difference]: Without dead ends: 640 [2021-06-05 22:25:17,701 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3526.2ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:25:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2021-06-05 22:25:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 447. [2021-06-05 22:25:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.091928251121076) internal successors, (1379), 446 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1379 transitions. [2021-06-05 22:25:17,706 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1379 transitions. Word has length 20 [2021-06-05 22:25:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:17,706 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1379 transitions. [2021-06-05 22:25:17,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1379 transitions. [2021-06-05 22:25:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:17,707 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:17,707 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:17,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8817,281 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:17,907 INFO L430 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1422244324, now seen corresponding path program 80 times [2021-06-05 22:25:17,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:17,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902552805] [2021-06-05 22:25:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:18,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:18,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902552805] [2021-06-05 22:25:18,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902552805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:18,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399987678] [2021-06-05 22:25:18,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:18,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:25:18,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:18,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:18,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:18,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:18,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:18,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:18,561 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:18,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:18,567 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:18,866 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2021-06-05 22:25:18,867 INFO L628 ElimStorePlain]: treesize reduction 155, result has 68.8 percent of original size [2021-06-05 22:25:18,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:18,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:18,872 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,012 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:25:19,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:19,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:19,018 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,160 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:25:19,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:19,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:19,166 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,301 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:25:19,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:19,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:19,307 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:19,312 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,433 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 22:25:19,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:19,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:19,440 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:19,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:19,445 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:19,557 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 22:25:19,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:19,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:25:19,565 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 22:25:19,788 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 22:25:20,140 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 22:25:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:20,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399987678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:20,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:20,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:20,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352713224] [2021-06-05 22:25:20,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:20,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:20,465 INFO L87 Difference]: Start difference. First operand 447 states and 1379 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:21,351 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2021-06-05 22:25:21,966 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 133 [2021-06-05 22:25:22,957 WARN L205 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 143 [2021-06-05 22:25:23,148 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 22:25:23,387 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 22:25:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:23,414 INFO L93 Difference]: Finished difference Result 618 states and 1825 transitions. [2021-06-05 22:25:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:25:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:23,416 INFO L225 Difference]: With dead ends: 618 [2021-06-05 22:25:23,416 INFO L226 Difference]: Without dead ends: 603 [2021-06-05 22:25:23,416 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3573.8ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:25:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-06-05 22:25:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 445. [2021-06-05 22:25:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.09009009009009) internal successors, (1372), 444 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1372 transitions. [2021-06-05 22:25:23,420 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1372 transitions. Word has length 20 [2021-06-05 22:25:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:23,420 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1372 transitions. [2021-06-05 22:25:23,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1372 transitions. [2021-06-05 22:25:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:23,421 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:23,421 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:23,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 282 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8850 [2021-06-05 22:25:23,621 INFO L430 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:23,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 937121676, now seen corresponding path program 81 times [2021-06-05 22:25:23,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:23,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85829087] [2021-06-05 22:25:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:23,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:23,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85829087] [2021-06-05 22:25:23,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85829087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:23,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961852667] [2021-06-05 22:25:23,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:23,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 22:25:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:23,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:25:23,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:24,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:24,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:24,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:25:24,261 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:24,268 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:24,275 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:25:24,280 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,565 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2021-06-05 22:25:24,565 INFO L628 ElimStorePlain]: treesize reduction 357, result has 47.3 percent of original size [2021-06-05 22:25:24,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:24,570 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:24,575 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:24,580 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,698 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 22:25:24,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:24,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:24,704 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:24,709 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:24,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:24,714 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:24,914 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 22:25:24,915 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 22:25:24,920 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:25:24,921 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:232 [2021-06-05 22:25:25,239 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2021-06-05 22:25:25,615 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 103 [2021-06-05 22:25:26,684 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1670, v_prenex_1672, v_prenex_1664, v_prenex_1666, v_prenex_1668], 1=[v_prenex_1669, v_prenex_1671, v_prenex_1673, get_0, v_prenex_1665, v_prenex_1667]} [2021-06-05 22:25:26,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 22:25:26,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:26,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:26,704 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:26,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:26,714 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:26,722 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 22:25:26,723 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:26,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:26,733 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:26,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:26,743 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,207 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 95 [2021-06-05 22:25:27,207 INFO L628 ElimStorePlain]: treesize reduction 1555, result has 15.8 percent of original size [2021-06-05 22:25:27,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:27,213 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,327 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:25:27,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:27,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:27,334 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,444 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 22:25:27,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:27,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:25:27,450 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,554 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 22:25:27,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:27,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:27,559 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,661 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 22:25:27,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:27,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:25:27,667 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:27,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1669 vanished before elimination [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1671 vanished before elimination [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1673 vanished before elimination [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1665 vanished before elimination [2021-06-05 22:25:27,767 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1667 vanished before elimination [2021-06-05 22:25:27,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:25:27,770 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:1959, output treesize:187 [2021-06-05 22:25:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:27,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961852667] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:27,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:27,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:27,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924849983] [2021-06-05 22:25:27,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:27,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:27,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:27,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:27,981 INFO L87 Difference]: Start difference. First operand 445 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:28,389 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 136 [2021-06-05 22:25:28,915 WARN L205 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 147 [2021-06-05 22:25:30,209 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 240 DAG size of output: 209 [2021-06-05 22:25:30,383 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 22:25:31,673 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 257 DAG size of output: 217 [2021-06-05 22:25:31,896 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2021-06-05 22:25:33,257 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2021-06-05 22:25:33,485 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2021-06-05 22:25:34,950 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 272 DAG size of output: 205 [2021-06-05 22:25:35,281 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-06-05 22:25:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:35,325 INFO L93 Difference]: Finished difference Result 928 states and 2743 transitions. [2021-06-05 22:25:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 22:25:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:35,326 INFO L225 Difference]: With dead ends: 928 [2021-06-05 22:25:35,326 INFO L226 Difference]: Without dead ends: 895 [2021-06-05 22:25:35,327 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 7971.8ms TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-06-05 22:25:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2021-06-05 22:25:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 449. [2021-06-05 22:25:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.09375) internal successors, (1386), 448 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1386 transitions. [2021-06-05 22:25:35,333 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1386 transitions. Word has length 20 [2021-06-05 22:25:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:35,333 INFO L482 AbstractCegarLoop]: Abstraction has 449 states and 1386 transitions. [2021-06-05 22:25:35,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1386 transitions. [2021-06-05 22:25:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:35,333 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:35,333 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:35,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8928 [2021-06-05 22:25:35,534 INFO L430 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash 844201320, now seen corresponding path program 82 times [2021-06-05 22:25:35,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:35,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836512114] [2021-06-05 22:25:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:35,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:35,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836512114] [2021-06-05 22:25:35,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836512114] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:35,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237450706] [2021-06-05 22:25:35,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:35,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:25:35,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:35,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:25:35,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:36,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:36,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:36,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:36,677 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 22:25:36,678 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 22:25:36,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:36,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:36,684 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:36,857 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 22:25:36,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:36,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:36,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:36,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:36,864 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:36,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:36,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:36,871 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,036 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 22:25:37,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:37,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:37,043 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:37,049 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,200 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 22:25:37,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:37,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:37,207 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:37,212 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,358 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 22:25:37,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:37,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:37,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:37,366 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:37,522 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:25:37,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:37,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:25:37,531 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 22:25:37,765 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 22:25:38,150 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 22:25:38,716 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 117 [2021-06-05 22:25:39,044 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1730, v_prenex_1699, v_prenex_1721, v_prenex_1723, v_prenex_1701, v_prenex_1711, v_prenex_1725, v_prenex_1703, v_prenex_1713, v_prenex_1705, v_prenex_1715, v_prenex_1707, v_prenex_1717, v_prenex_1709, v_prenex_1719], 1=[v_prenex_1710, get_0, v_prenex_1731, v_prenex_1720, v_prenex_1712, v_prenex_1722, v_prenex_1700, v_prenex_1714, v_prenex_1724, v_prenex_1702, v_prenex_1716, v_prenex_1726, v_prenex_1704, v_prenex_1718, v_prenex_1706, v_prenex_1708]} [2021-06-05 22:25:39,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:39,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:39,686 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 130 [2021-06-05 22:25:39,686 INFO L628 ElimStorePlain]: treesize reduction 1301, result has 23.5 percent of original size [2021-06-05 22:25:39,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:25:39,694 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:39,858 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-05 22:25:39,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:39,859 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1699 vanished before elimination [2021-06-05 22:25:39,859 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1721 vanished before elimination [2021-06-05 22:25:39,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:39,866 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,027 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 22:25:40,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:40,036 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,198 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 22:25:40,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:40,206 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,366 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 22:25:40,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:25:40,374 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,528 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 22:25:40,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,528 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1703 vanished before elimination [2021-06-05 22:25:40,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:40,535 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,686 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 22:25:40,687 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,687 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1705 vanished before elimination [2021-06-05 22:25:40,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:25:40,693 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:40,852 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 22:25:40,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:40,852 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1707 vanished before elimination [2021-06-05 22:25:40,852 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1717 vanished before elimination [2021-06-05 22:25:40,852 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1709 vanished before elimination [2021-06-05 22:25:40,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:25:40,858 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:41,002 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 22:25:41,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1710 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1731 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1720 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1712 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1722 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1700 vanished before elimination [2021-06-05 22:25:41,002 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1714 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1724 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1702 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1716 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1726 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1704 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1718 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1706 vanished before elimination [2021-06-05 22:25:41,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1708 vanished before elimination [2021-06-05 22:25:41,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 32 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 22:25:41,008 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 48 variables, input treesize:1707, output treesize:278 [2021-06-05 22:25:41,241 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 22:25:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:41,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237450706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:41,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:41,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:41,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778212690] [2021-06-05 22:25:41,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:41,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:41,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:41,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:41,379 INFO L87 Difference]: Start difference. First operand 449 states and 1386 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:41,729 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-05 22:25:42,267 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2021-06-05 22:25:42,951 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 140 [2021-06-05 22:25:43,112 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2021-06-05 22:25:43,975 WARN L205 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 208 [2021-06-05 22:25:44,272 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-06-05 22:25:44,937 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2021-06-05 22:25:45,095 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 22:25:45,825 WARN L205 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 167 [2021-06-05 22:25:45,997 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-06-05 22:25:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:46,020 INFO L93 Difference]: Finished difference Result 912 states and 2641 transitions. [2021-06-05 22:25:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:25:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:46,022 INFO L225 Difference]: With dead ends: 912 [2021-06-05 22:25:46,022 INFO L226 Difference]: Without dead ends: 870 [2021-06-05 22:25:46,022 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5780.6ms TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2021-06-05 22:25:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-06-05 22:25:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 457. [2021-06-05 22:25:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.1008771929824563) internal successors, (1414), 456 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1414 transitions. [2021-06-05 22:25:46,028 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1414 transitions. Word has length 20 [2021-06-05 22:25:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:46,028 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1414 transitions. [2021-06-05 22:25:46,028 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1414 transitions. [2021-06-05 22:25:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:46,028 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:46,029 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:46,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 284 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9205 [2021-06-05 22:25:46,229 INFO L430 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 637193638, now seen corresponding path program 83 times [2021-06-05 22:25:46,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:46,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011238553] [2021-06-05 22:25:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:46,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:46,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011238553] [2021-06-05 22:25:46,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011238553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:46,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477028765] [2021-06-05 22:25:46,628 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:46,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:25:46,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:46,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:46,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:46,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:46,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:46,801 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:46,805 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,810 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:46,815 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:46,819 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:46,824 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:46,828 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:46,833 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,838 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:46,843 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:46,847 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,852 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:46,857 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:46,862 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,867 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:46,872 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:46,882 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:46,887 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,893 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,898 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,903 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:25:46,908 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,914 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,919 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,924 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,929 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:25:46,935 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:46,940 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,945 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:46,950 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:46,954 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:46,959 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,962 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:46,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:46,966 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:47,102 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 22:25:47,102 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 22:25:47,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:25:47,103 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:25:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:47,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477028765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:47,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:47,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:25:47,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564774358] [2021-06-05 22:25:47,630 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:25:47,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:47,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:25:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:25:47,630 INFO L87 Difference]: Start difference. First operand 457 states and 1414 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:48,109 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 22:25:48,566 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 22:25:49,075 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2021-06-05 22:25:49,679 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 94 [2021-06-05 22:25:50,383 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2021-06-05 22:25:51,203 WARN L205 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2021-06-05 22:25:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:51,219 INFO L93 Difference]: Finished difference Result 829 states and 2393 transitions. [2021-06-05 22:25:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:25:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:51,221 INFO L225 Difference]: With dead ends: 829 [2021-06-05 22:25:51,221 INFO L226 Difference]: Without dead ends: 808 [2021-06-05 22:25:51,221 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4103.9ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-06-05 22:25:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2021-06-05 22:25:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 459. [2021-06-05 22:25:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 3.1026200873362444) internal successors, (1421), 458 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1421 transitions. [2021-06-05 22:25:51,227 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1421 transitions. Word has length 20 [2021-06-05 22:25:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:51,227 INFO L482 AbstractCegarLoop]: Abstraction has 459 states and 1421 transitions. [2021-06-05 22:25:51,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1421 transitions. [2021-06-05 22:25:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:51,227 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:51,227 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:51,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9323 [2021-06-05 22:25:51,428 INFO L430 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -581441722, now seen corresponding path program 84 times [2021-06-05 22:25:51,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:51,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598621472] [2021-06-05 22:25:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:51,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:51,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598621472] [2021-06-05 22:25:51,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598621472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:51,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391968339] [2021-06-05 22:25:51,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:51,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 22:25:51,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:25:51,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:51,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:51,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,885 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:51,889 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:51,893 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:51,898 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:51,902 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,906 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,911 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:51,915 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:51,920 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:51,924 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,929 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:51,933 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:51,937 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:51,941 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:25:51,946 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:51,950 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:51,954 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:51,958 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:51,962 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:25:51,967 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:25:51,971 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:51,975 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:51,979 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:51,983 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:51,988 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:51,992 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:25:51,996 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:51,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:52,000 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:25:52,004 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:52,008 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:52,012 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:52,016 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:52,020 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:25:52,023 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:25:52,027 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:52,157 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 22:25:52,157 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 22:25:52,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:25:52,158 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:25:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:52,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391968339] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:52,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:52,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:52,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867699817] [2021-06-05 22:25:52,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:52,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:52,661 INFO L87 Difference]: Start difference. First operand 459 states and 1421 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:52,980 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 22:25:53,466 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 22:25:53,627 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2021-06-05 22:25:54,025 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2021-06-05 22:25:54,180 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-06-05 22:25:54,661 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2021-06-05 22:25:54,861 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 22:25:55,398 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2021-06-05 22:25:55,615 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-06-05 22:25:56,236 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2021-06-05 22:25:56,448 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-05 22:25:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:25:56,467 INFO L93 Difference]: Finished difference Result 958 states and 2731 transitions. [2021-06-05 22:25:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 22:25:56,467 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:25:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:25:56,468 INFO L225 Difference]: With dead ends: 958 [2021-06-05 22:25:56,468 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 22:25:56,468 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 4142.7ms TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2021-06-05 22:25:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 22:25:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 461. [2021-06-05 22:25:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 3.1) internal successors, (1426), 460 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1426 transitions. [2021-06-05 22:25:56,474 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1426 transitions. Word has length 20 [2021-06-05 22:25:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:25:56,474 INFO L482 AbstractCegarLoop]: Abstraction has 461 states and 1426 transitions. [2021-06-05 22:25:56,475 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1426 transitions. [2021-06-05 22:25:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:25:56,475 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:25:56,475 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:25:56,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9350 [2021-06-05 22:25:56,676 INFO L430 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:25:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:25:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2058431408, now seen corresponding path program 85 times [2021-06-05 22:25:56,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:25:56,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096491455] [2021-06-05 22:25:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:25:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:56,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:25:56,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096491455] [2021-06-05 22:25:56,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096491455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:56,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10719221] [2021-06-05 22:25:56,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:25:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:25:56,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:25:56,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:25:57,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:57,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:25:57,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:57,195 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,448 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-06-05 22:25:57,449 INFO L628 ElimStorePlain]: treesize reduction 140, result has 67.9 percent of original size [2021-06-05 22:25:57,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:57,454 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,568 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:25:57,568 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:57,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:57,574 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:57,579 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,683 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 22:25:57,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:57,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:57,689 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:25:57,694 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:57,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:25:57,790 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:57,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:25:57,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:25:57,884 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:25:57,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:25:57,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:25:57,979 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 22:25:58,143 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:25:58,331 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 22:25:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:25:58,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10719221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:25:58,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:25:58,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:25:58,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657909062] [2021-06-05 22:25:58,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:25:58,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:25:58,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:25:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:25:58,919 INFO L87 Difference]: Start difference. First operand 461 states and 1426 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:25:59,257 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2021-06-05 22:25:59,782 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2021-06-05 22:26:00,361 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2021-06-05 22:26:00,531 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-06-05 22:26:01,005 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2021-06-05 22:26:01,215 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2021-06-05 22:26:01,940 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 133 [2021-06-05 22:26:02,150 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-06-05 22:26:02,732 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2021-06-05 22:26:02,952 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 22:26:03,228 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2021-06-05 22:26:03,558 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2021-06-05 22:26:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:26:03,559 INFO L93 Difference]: Finished difference Result 1135 states and 3187 transitions. [2021-06-05 22:26:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 22:26:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:26:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:26:03,560 INFO L225 Difference]: With dead ends: 1135 [2021-06-05 22:26:03,560 INFO L226 Difference]: Without dead ends: 1087 [2021-06-05 22:26:03,561 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 5146.3ms TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:26:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-06-05 22:26:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 473. [2021-06-05 22:26:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.0889830508474576) internal successors, (1458), 472 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1458 transitions. [2021-06-05 22:26:03,568 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1458 transitions. Word has length 20 [2021-06-05 22:26:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:26:03,568 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1458 transitions. [2021-06-05 22:26:03,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1458 transitions. [2021-06-05 22:26:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:26:03,568 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:26:03,568 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:26:03,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9375,287 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:03,769 INFO L430 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:26:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:26:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1744944628, now seen corresponding path program 86 times [2021-06-05 22:26:03,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:26:03,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999672244] [2021-06-05 22:26:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:26:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:26:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:04,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:26:04,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999672244] [2021-06-05 22:26:04,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999672244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:04,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792427941] [2021-06-05 22:26:04,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:04,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 22:26:04,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:26:04,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 22:26:04,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:26:04,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:04,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:04,569 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:04,579 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:04,588 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:04,596 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:04,605 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,915 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 22:26:04,915 INFO L628 ElimStorePlain]: treesize reduction 362, result has 47.8 percent of original size [2021-06-05 22:26:04,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:04,921 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:04,927 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:04,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:04,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:04,931 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:05,175 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2021-06-05 22:26:05,175 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 22:26:05,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:05,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:05,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:05,180 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:05,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:05,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:05,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:05,185 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:05,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:05,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:05,189 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:05,302 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-06-05 22:26:05,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:05,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:26:05,309 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:895, output treesize:259 [2021-06-05 22:26:05,879 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 124 [2021-06-05 22:26:06,181 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-06-05 22:26:06,481 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2021-06-05 22:26:06,739 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1801, v_prenex_1790, v_prenex_1792, v_prenex_1780, v_prenex_1794, v_prenex_1782, v_prenex_1774, v_prenex_1796, v_prenex_1784, v_prenex_1776, v_prenex_1778, v_prenex_1788], 1=[v_prenex_1802, v_prenex_1779, v_prenex_1781, v_prenex_1791, v_prenex_1783, v_prenex_1793, v_prenex_1785, v_prenex_1795, v_prenex_1775, v_prenex_1797, v_prenex_1789, v_prenex_1777]} [2021-06-05 22:26:06,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:06,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:06,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:06,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:06,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:06,773 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,135 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 91 [2021-06-05 22:26:07,135 INFO L628 ElimStorePlain]: treesize reduction 888, result has 23.6 percent of original size [2021-06-05 22:26:07,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:26:07,141 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,250 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:26:07,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:07,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:26:07,255 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,363 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 22:26:07,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:07,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:26:07,369 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,473 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 22:26:07,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:07,474 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1794 vanished before elimination [2021-06-05 22:26:07,474 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1782 vanished before elimination [2021-06-05 22:26:07,474 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1774 vanished before elimination [2021-06-05 22:26:07,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 22:26:07,479 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,580 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 22:26:07,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:07,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 22:26:07,585 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:07,688 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 22:26:07,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:07,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1776 vanished before elimination [2021-06-05 22:26:07,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1778 vanished before elimination [2021-06-05 22:26:07,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1788 vanished before elimination [2021-06-05 22:26:07,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1802 vanished before elimination [2021-06-05 22:26:07,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1779 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1781 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1791 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1783 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1793 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1785 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1795 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1775 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1797 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1789 vanished before elimination [2021-06-05 22:26:07,689 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1777 vanished before elimination [2021-06-05 22:26:07,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 24 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 22:26:07,692 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 36 variables, input treesize:1271, output treesize:187 [2021-06-05 22:26:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:07,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792427941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:07,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:26:07,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:26:07,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95435265] [2021-06-05 22:26:07,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:26:07,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:26:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:26:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:26:07,888 INFO L87 Difference]: Start difference. First operand 473 states and 1458 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:08,219 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2021-06-05 22:26:08,787 WARN L205 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 197 [2021-06-05 22:26:09,461 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 201 [2021-06-05 22:26:10,661 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 227 DAG size of output: 206 [2021-06-05 22:26:11,698 WARN L205 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 216 [2021-06-05 22:26:12,819 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 234 DAG size of output: 225 [2021-06-05 22:26:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:26:12,832 INFO L93 Difference]: Finished difference Result 888 states and 2589 transitions. [2021-06-05 22:26:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:26:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:26:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:26:12,834 INFO L225 Difference]: With dead ends: 888 [2021-06-05 22:26:12,834 INFO L226 Difference]: Without dead ends: 861 [2021-06-05 22:26:12,834 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 6101.0ms TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-06-05 22:26:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-06-05 22:26:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 476. [2021-06-05 22:26:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.086315789473684) internal successors, (1466), 475 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1466 transitions. [2021-06-05 22:26:12,840 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1466 transitions. Word has length 20 [2021-06-05 22:26:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:26:12,840 INFO L482 AbstractCegarLoop]: Abstraction has 476 states and 1466 transitions. [2021-06-05 22:26:12,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1466 transitions. [2021-06-05 22:26:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:26:12,841 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:26:12,841 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:26:13,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 288 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9453 [2021-06-05 22:26:13,041 INFO L430 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:26:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:26:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1265659952, now seen corresponding path program 87 times [2021-06-05 22:26:13,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:26:13,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251902333] [2021-06-05 22:26:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:26:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:26:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:13,461 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:26:13,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251902333] [2021-06-05 22:26:13,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251902333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:13,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470904215] [2021-06-05 22:26:13,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:13,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 22:26:13,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:26:13,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:26:13,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:26:13,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:13,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:13,745 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,001 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-06-05 22:26:14,001 INFO L628 ElimStorePlain]: treesize reduction 155, result has 66.2 percent of original size [2021-06-05 22:26:14,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:14,007 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:14,012 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,125 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 22:26:14,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:14,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:14,131 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:14,136 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:14,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:14,241 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:14,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:14,345 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,446 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 22:26:14,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:14,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 22:26:14,452 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 22:26:14,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-06-05 22:26:14,456 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:14,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 22:26:14,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2021-06-05 22:26:14,551 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 22:26:14,716 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 22:26:14,907 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 22:26:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:15,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470904215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:15,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:26:15,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:26:15,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013928422] [2021-06-05 22:26:15,552 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:26:15,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:26:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:26:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:26:15,553 INFO L87 Difference]: Start difference. First operand 476 states and 1466 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:15,860 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2021-06-05 22:26:16,391 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2021-06-05 22:26:16,545 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-06-05 22:26:16,937 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2021-06-05 22:26:17,145 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 22:26:17,634 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2021-06-05 22:26:17,858 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 22:26:18,373 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 133 [2021-06-05 22:26:18,635 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2021-06-05 22:26:19,225 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 140 [2021-06-05 22:26:19,466 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2021-06-05 22:26:19,879 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2021-06-05 22:26:20,289 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 136 [2021-06-05 22:26:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:26:20,290 INFO L93 Difference]: Finished difference Result 1148 states and 3227 transitions. [2021-06-05 22:26:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 22:26:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:26:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:26:20,292 INFO L225 Difference]: With dead ends: 1148 [2021-06-05 22:26:20,292 INFO L226 Difference]: Without dead ends: 1112 [2021-06-05 22:26:20,292 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5429.9ms TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 22:26:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2021-06-05 22:26:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 482. [2021-06-05 22:26:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 3.087318087318087) internal successors, (1485), 481 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1485 transitions. [2021-06-05 22:26:20,299 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1485 transitions. Word has length 20 [2021-06-05 22:26:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:26:20,299 INFO L482 AbstractCegarLoop]: Abstraction has 482 states and 1485 transitions. [2021-06-05 22:26:20,299 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1485 transitions. [2021-06-05 22:26:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:26:20,300 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:26:20,300 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:26:20,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9574,289 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:20,500 INFO L430 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:26:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:26:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1330586956, now seen corresponding path program 88 times [2021-06-05 22:26:20,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:26:20,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652500077] [2021-06-05 22:26:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:26:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:26:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:21,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:26:21,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652500077] [2021-06-05 22:26:21,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652500077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:21,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663638454] [2021-06-05 22:26:21,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:21,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 22:26:21,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:26:21,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 22:26:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:26:21,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:21,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:26:21,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:21,249 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:21,254 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:21,258 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:21,263 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:21,268 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:21,273 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:21,277 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:21,282 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:21,287 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:21,292 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,296 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,301 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,306 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,311 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:26:21,316 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,320 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:21,325 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,330 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,335 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,339 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:26:21,344 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:21,348 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,353 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,357 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:21,361 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,365 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,370 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:26:21,374 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,378 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:21,382 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,386 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:21,389 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:21,393 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:21,397 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:21,527 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2021-06-05 22:26:21,528 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 22:26:21,529 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:26:21,529 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 22:26:21,790 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 22:26:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:22,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663638454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:22,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:26:22,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 22:26:22,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409508459] [2021-06-05 22:26:22,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 22:26:22,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:26:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 22:26:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 22:26:22,151 INFO L87 Difference]: Start difference. First operand 482 states and 1485 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:22,650 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2021-06-05 22:26:23,209 WARN L205 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2021-06-05 22:26:23,725 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2021-06-05 22:26:24,376 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 98 [2021-06-05 22:26:25,330 WARN L205 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 105 [2021-06-05 22:26:26,168 WARN L205 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 119 [2021-06-05 22:26:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 22:26:26,193 INFO L93 Difference]: Finished difference Result 889 states and 2601 transitions. [2021-06-05 22:26:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 22:26:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 22:26:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 22:26:26,195 INFO L225 Difference]: With dead ends: 889 [2021-06-05 22:26:26,195 INFO L226 Difference]: Without dead ends: 874 [2021-06-05 22:26:26,195 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4809.0ms TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2021-06-05 22:26:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-06-05 22:26:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 473. [2021-06-05 22:26:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.0953389830508473) internal successors, (1461), 472 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1461 transitions. [2021-06-05 22:26:26,201 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1461 transitions. Word has length 20 [2021-06-05 22:26:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 22:26:26,201 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1461 transitions. [2021-06-05 22:26:26,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1461 transitions. [2021-06-05 22:26:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 22:26:26,201 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 22:26:26,201 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 22:26:26,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9669 [2021-06-05 22:26:26,402 INFO L430 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 22:26:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 22:26:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash -647803412, now seen corresponding path program 89 times [2021-06-05 22:26:26,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 22:26:26,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501839697] [2021-06-05 22:26:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 22:26:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 22:26:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:26,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 22:26:26,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501839697] [2021-06-05 22:26:26,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501839697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:26,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399517454] [2021-06-05 22:26:26,688 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 22:26:26,717 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 22:26:26,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 22:26:26,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 22:26:26,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 22:26:26,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,853 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:26,858 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,863 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:26,868 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,873 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,878 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:26,883 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,888 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,892 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,897 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 22:26:26,902 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 22:26:26,907 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:26,912 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:26:26,917 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,922 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,927 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:26,931 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,938 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 22:26:26,945 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:26,952 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:26,958 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-06-05 22:26:26,965 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:26,971 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:26,976 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:26,982 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:26,987 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:26,993 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:26,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:26,998 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-06-05 22:26:27,004 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:27,009 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:27,014 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 22:26:27,019 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-06-05 22:26:27,024 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 22:26:27,029 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 22:26:27,034 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 22:26:27,240 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2021-06-05 22:26:27,241 INFO L628 ElimStorePlain]: treesize reduction 347, result has 39.9 percent of original size [2021-06-05 22:26:27,243 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 22:26:27,243 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1873, output treesize:230 [2021-06-05 22:26:27,831 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-05 22:26:28,021 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 22:26:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 22:26:28,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399517454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 22:26:28,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 22:26:28,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 22:26:28,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67113205] [2021-06-05 22:26:28,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 22:26:28,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 22:26:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 22:26:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 22:26:28,121 INFO L87 Difference]: Start difference. First operand 473 states and 1461 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 22:26:28,542 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 22:26:28,943 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 22:26:29,079 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2021-06-05 22:26:29,548 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2021-06-05 22:26:29,764 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 Received shutdown request... [2021-06-05 22:26:30,057 WARN L222 SmtUtils]: Removed 2 from assertion stack [2021-06-05 22:26:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 22:26:30,257 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 291 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9693 [2021-06-05 22:26:30,258 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 22:26:30,259 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 22:26:30,261 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 22:26:30,261 INFO L202 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:26:30 BasicIcfg [2021-06-05 22:26:30,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 22:26:30,261 INFO L168 Benchmark]: Toolchain (without parser) took 761407.00 ms. Allocated memory was 333.4 MB in the beginning and 497.0 MB in the end (delta: 163.6 MB). Free memory was 312.9 MB in the beginning and 353.2 MB in the end (delta: -40.3 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.0 GB. [2021-06-05 22:26:30,261 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 333.4 MB. Free memory was 314.3 MB in the beginning and 314.2 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 22:26:30,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.64 ms. Allocated memory is still 333.4 MB. Free memory was 312.8 MB in the beginning and 311.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 22:26:30,261 INFO L168 Benchmark]: Boogie Preprocessor took 16.44 ms. Allocated memory is still 333.4 MB. Free memory was 311.3 MB in the beginning and 310.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 22:26:30,262 INFO L168 Benchmark]: RCFGBuilder took 511.52 ms. Allocated memory is still 333.4 MB. Free memory was 310.2 MB in the beginning and 310.4 MB in the end (delta: -198.4 kB). Peak memory consumption was 23.7 MB. Max. memory is 16.0 GB. [2021-06-05 22:26:30,262 INFO L168 Benchmark]: TraceAbstraction took 760848.27 ms. Allocated memory was 333.4 MB in the beginning and 497.0 MB in the end (delta: 163.6 MB). Free memory was 310.4 MB in the beginning and 353.2 MB in the end (delta: -42.9 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.0 GB. [2021-06-05 22:26:30,262 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 333.4 MB. Free memory was 314.3 MB in the beginning and 314.2 MB in the end (delta: 71.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 26.64 ms. Allocated memory is still 333.4 MB. Free memory was 312.8 MB in the beginning and 311.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 16.44 ms. Allocated memory is still 333.4 MB. Free memory was 311.3 MB in the beginning and 310.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 511.52 ms. Allocated memory is still 333.4 MB. Free memory was 310.2 MB in the beginning and 310.4 MB in the end (delta: -198.4 kB). Peak memory consumption was 23.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 760848.27 ms. Allocated memory was 333.4 MB in the beginning and 497.0 MB in the end (delta: 163.6 MB). Free memory was 310.4 MB in the beginning and 353.2 MB in the end (delta: -42.9 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (473states) and FLOYD_HOARE automaton (currently 13 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 92 for 244ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 760757.2ms, OverallIterations: 481, TraceHistogramMax: 1, EmptinessCheckTime: 210.6ms, AutomataDifference: 374055.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24462 SDtfs, 45710 SDslu, 111405 SDs, 0 SdLazy, 91174 SolverSat, 4311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52748.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11380 GetRequests, 4637 SyntacticMatches, 267 SemanticMatches, 6475 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10216 ImplicationChecksByTransitivity, 435304.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=479, InterpolantAutomatonStates: 4063, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1953.3ms AutomataMinimizationTime, 480 MinimizatonAttempts, 89201 StatesRemovedByMinimization, 478 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1436.9ms SsaConstructionTime, 3394.5ms SatisfiabilityAnalysisTime, 313566.5ms InterpolantComputationTime, 14388 NumberOfCodeBlocks, 14388 NumberOfCodeBlocksAsserted, 982 NumberOfCheckSat, 13617 ConstructedInterpolants, 484 QuantifiedInterpolants, 284637 SizeOfPredicates, 2104 NumberOfNonLiveVariables, 21090 ConjunctsInSsa, 4233 ConjunctsInUnsatCore, 771 InterpolantComputations, 191 PerfectInterpolantSequences, 296/1304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown